In this paper we compare various Sudoku solving algorithms in order to determine what kind of run-time improvements different optimizations can give. We will also examine what kind of effect the existence of multiple solutions in the puzzles has on our result.
| Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:kth-166739 |
| Date | January 2015 |
| Creators | Golan, Jonathan, Kallin, Joel |
| Publisher | KTH, Skolan för datavetenskap och kommunikation (CSC) |
| Source Sets | DiVA Archive at Upsalla University |
| Language | English |
| Detected Language | English |
| Type | Student thesis, info:eu-repo/semantics/bachelorThesis, text |
| Format | application/pdf |
| Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.0019 seconds