umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
En studie om styrkor och svagheter hos sudokulösande algoritmer
Umeå University, Faculty of Science and Technology, Department of Computing Science.
2014 (Swedish)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

Sudoku is a popular game of logic in the form of a puzzle. Sudoku puzzles are printed daily in Swedish newspapers. The challenge of solving these puzzles have inspired many programmers to develop Sudokusolving algorithms. These algorithms use different approaches in order to quickly and efficiently solve the puzzles. One such approach is the use of logical strategies initially developed for human players. The purpose of this project is to benchmark and compare different approaches and algorithms. The results of the benchmarks is then used to evaluate the strength and weaknesses of each algorithm. The benchmark is performed with 12000 Sudoku puzzles of varying difficulty. The study shows that Dancing Links is the best performing algorithm in general. Dancing Links excels in each comparison criteria, one of which is solving speed. An algorithm that does not impress is Backtracking. The algorithm consistently takes the most time to solve a puzzle. The solving speed of the algorithm also varies greatly depending on the number of clues in the puzzle. This makes the algorithm less suitable for applications were solving speed is of concern. Only the strategy-based algorithm fails to solve all the puzzles. However the algorithm did manage to solve the easier puzzles and is consistently faster than Backtracking. A trend was observed where the algorithm’s speed was negatively affected by an increasing difficulty.

Place, publisher, year, edition, pages
2014.
Series
UMNAD, 988
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:umu:diva-92801OAI: oai:DiVA.org:umu-92801DiVA: diva2:743440
Educational program
Bachelor of Science Programme in Computing Science
Supervisors
Examiners
Available from: 2014-09-04 Created: 2014-09-04 Last updated: 2014-09-04Bibliographically approved

Open Access in DiVA

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

By organisation
Department of Computing Science
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 113 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

urn-nbn

Altmetric score

urn-nbn
Total: 133 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf