Efficiency of the hybrid AC3-tabu search algorithm for solving Sudoku puzzles
Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
There are many different algorithms for solving Sudoku puzzles, with one of the newer algorithms being the hybrid AC3-tabu search algorithm. Since the algorithm has not been subject of much research, the aim of this thesis is to increase the knowledge of it.
This thesis evaluates the efficiency of the hybrid AC3-tabu search algorithm by analyzing how quickly it solves puzzles compared to two other solving algorithms: one using brute-force search, and one combining human solving techniques with brute-force search. This thesis also investigates if there is a correlation between the number of puzzle clues and the solving time for the hybrid AC3-tabu search algorithm.
The results show that the hybrid AC3-tabu search algorithm is less efficient than the two other algorithms, and that there seems to be a correlation between the number of clues and the solving time for the algorithm. The conclusion is that due to the algorithm’s low efficiency and some of its characteristics, it is not suitable for solving Sudoku puzzles.
Place, publisher, year, edition, pages
IdentifiersURN: urn:nbn:se:kth:diva-166421OAI: oai:DiVA.org:kth-166421DiVA: diva2:810999