Change search

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
A REPORT ON THE SUDOKU SOLVER
KTH, School of Computer Science and Communication (CSC).
KTH, School of Computer Science and Communication (CSC).
2013 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

In the last decade, solving the Sudoku puzzle has become every one’s passion. The simplicity of puzzle’s structure and the low requirement of mathematical skills caused people to have enormous interest in accepting challenges to solve the puzzle. Therefore, developers have tried to find algorithms in order to generate the variety of puzzles for human players so that they could be even solved by computer programming. In this essay, we have presented an algorithm called pencil-and-paper using human strategies. The purpose is to implement a more efficient algorithm and then compare it with another Sudoku solver named as brute force algorithm. This algorithm is a general algorithm that can be employed in to any problems. The results have proved that the pencil-and-paper algorithm solves the puzzle faster and more effective than the brute force algorithm.

Abstract [sv]

Under senaste decenniet har Sudoku pusslet blivit väldigt populär runt om i världen. Sudoku-bräde har en enkel struktur med lättlärda regler som lockar fler mänskliga spelare att acceptera utmaningar för att lösa pusslet. Således har utvecklarna försökt att hitta algoritmer för att generera olika pussel för mänskliga spelare. Dessa algoritmer kan också lösa de generade pusslen med hjälp av dator programmering. I denna uppsats har vi presenterat en algoritm så kallat "pencil-and-paper" som utnyttjar mänskliga strategier. Syftet är att implementera en mer effektiv algoritm vilket sedan jämförs det med en annan känd algoritm nämligen Brute Force. Denna algoritm är en generell algoritm som kan appliceras för att lösa vilket problem som helst. Resultaten har visat att pencil-and-paper algoritm löser pusslen snabbare och effektivare än Brute Force algoritm.

2013.
Series
Kandidatexjobb CSC ; K13002
National Category
Computer Sciences
Identifiers
OAI: oai:DiVA.org:kth-134816DiVA, id: diva2:668213
Educational program
Master of Science in Engineering - Computer Science and Technology
Examiners
Available from: 2013-12-13 Created: 2013-11-29 Last updated: 2018-01-11Bibliographically approved

Open Access in DiVA

File information
File name FULLTEXT01.pdfFile size 1247 kBChecksum SHA-512
fd4aeb9fe771b3842aa54bed5efd2b1f1feb718afd36dc3244fe7b8b061b8da901e9117ebc6af5e608c918564f29f7b2fc7e156ff47950e703c44d42e2b4073d
Type fulltextMimetype application/pdf

http://www.csc.kth.se/utbildning/kth/kurser/DD143X/dkand13/Group1Vahid/report/Aref-Fiorella-KexJobb-sist.pdf
By organisation
School of Computer Science and Communication (CSC)
On the subject
Computer Sciences

Search outside of DiVA

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: 170 hits

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
v. 2.34.0
|