Paralelizace, modifikace a implementace DLX algoritmu

Abstract

This diploma thesis describes in detail the Algorithm X, that seeks solution of the exact cover problem, and the Dancing Links algorithm (DLX) with his modified version.

The focus of this is on complete graph decomposition into subgraphs and creation of algorithms to build the task and its parallel solution. It serves as a basis for already proved theorems, allowing to construct of higher orders graphs decompositions.

Furthermore, there are two ways given translation of the problem of finding the Eternity II puzzle solution into a problem solvable by the Dancing Links algorithm. Eternity II is an interesting problem that certainly deserves more attention not only because it is associated with a prize of 2 000 000 USD for its first solution.