Applied computer science
Ein Projekt von
Supervision
Project team
Oliver Reisacher
Sudoku is a logic-based puzzle in which numbers have to be placed in a grid in such a way that
they fulfill certain requirements. The combination of simple rules and the creation
of complex puzzles has made the game popular worldwide. The aim of this work was to compare the algorithms
Ant Colony Optimization (ACO) and Dancing Links (DLX) in terms of their efficiency, scalability and
consistency when solving Sudoku of different sizes and difficulty levels.
In addition, the influence of parameter optimization on the performance of the ACO-
algorithm was investigated.
