Change search
ReferencesLink to record
Permanent link

Direct link
Scaling of popular Sudoku solving algorithms
KTH, School of Computer Science and Communication (CSC).
KTH, School of Computer Science and Communication (CSC).
2014 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

In this bachelor thesis we study 6 popular Sudoku solving algorithms, found through Google, to find the algorithm that has the slowest growth. The algorithms we tested are: brute-force, a pen-and-paper method, two exact cover reductions in Python and Haskell, a SAT reduction, and a constraint satisfaction algorithm. The algorithms were tried by solving Sudoku puzzles of sizes n = {2, 3, 4, 5} where we measured the solution time. We conclude that the slowest growing algorithm, by far, is the SAT reduction, followed by the exact cover reductions. Brute-force grows, unsurprisingly, the fastest.

Place, publisher, year, edition, pages
2014. , 26 p.
National Category
Computer Science
URN: urn:nbn:se:kth:diva-146012OAI: diva2:721634
Subject / course
Computer Science
Educational program
Bachelor of Science in Engineering - Computer Engineering
Available from: 2014-11-25 Created: 2014-06-04 Last updated: 2014-11-25Bibliographically approved

Open Access in DiVA

fulltext(345 kB)318 downloads
File information
File name FULLTEXT01.pdfFile size 345 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Videl, MarkusPalo, Mattias
By organisation
School of Computer Science and Communication (CSC)
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 318 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 95 hits
ReferencesLink to record
Permanent link

Direct link