Kakuro Solver Application
dc.contributor.author | Takahashi, Naomi | |
dc.date.accessioned | 2024-01-04T17:52:23Z | |
dc.date.available | 2024-01-04T17:52:23Z | |
dc.date.issued | 2010 | |
dc.description.abstract | In this paper, the application called KakuroSolver is presented that solves Kakuro, the popular logical puzzle that combines Sudoku and crossword. The application accepts a Kakuro puzzle with any size; it then either completely solves the puzzle, or lets the user solve it. This paper discusses the algorithms that can be used to solve Kakuro puzzles as well as other logical puzzles such as Sudoku. Kakuro puzzles are NP-complete, where a search is effective to find solutions. Therefore among those algorithms, KakuroSolver employs the backtracking search along with several techniques that minimizes the search to increase the efficiency. The architecture of the application is also described, and the entire application is evaluated including the future enhancements. The paper also contains the user manual of KakuroSolver. | en_US |
dc.identifier.uri | https://hdl.handle.net/10365/33560 | |
dc.publisher | North Dakota State University | en_US |
dc.rights | NDSU policy 190.6.2 | en_US |
dc.rights.uri | https://www.ndsu.edu/fileadmin/policy/190.pdf | en_US |
dc.subject.lcsh | Kakuro -- Data processing. | en_US |
dc.subject.lcsh | Logic puzzles -- Data processing. | en_US |
dc.title | Kakuro Solver Application | en_US |
dc.type | Master's Paper | en_US |
ndsu.advisor | Magel, Kenneth | |
ndsu.college | Engineering | en_US |
ndsu.degree | Master of Science (MS) | en_US |
ndsu.department | Computer Science | en_US |
ndsu.program | Computer Science | en_US |
Files
Original bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- Takahashi, Naomi_Computer Science MS_2010.pdf
- Size:
- 1.67 MB
- Format:
- Adobe Portable Document Format
- Description:
- Kakuro Solver Application
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.63 KB
- Format:
- Item-specific license agreed to upon submission
- Description: