Performance and Scalability of Sudoku Solvers

University essay from KTH/Skolan för datavetenskap och kommunikation (CSC); KTH/Skolan för datavetenskap och kommunikation (CSC)

Author: Henrik VikstÉn; Viktor Mattsson; [2013]

Keywords: ;

Abstract: This paper aims to clarify the differences in algorithm design with a goal of solving sudoku. A few algorithms were chosen suitable to the problem, yet different from one another. To take an everyday puzzle and utilize common computer science algorithms and learn more about them. Get relevant data to see how they perform in situations, how easily they can be modified and used in larger sudokus. Also how their performance scales when the puzzle grows larger. From the results Dancing links was the fastest and scaled best of the algorithms tested, while Brute-force and Simulated annealing struggled keeping consistent results.

  AT THIS PAGE YOU CAN DOWNLOAD THE WHOLE ESSAY. (follow the link to the next page)