Abstract
The thesis is concerned with an attempt to find different approaches to solve the Eternity II puzzle. The principle of the puzzle is described, as well as its complexity. The approaches include backtracking, simulated annealing, genetic algorithms and use of external SAT solvers. Each of them is presented at first in a general way, then in the Eternity II's matter. All algorithms are implemented and their efficiency has been measured and logged. The results are compared at the end. The thesis also involves a description of a written Simplify and Dimacs CNF formats convertor which can be used for solving any problem by certain SAT solvers.
Files
Thesis (only in Czech)
Presentation (only in Czech)