Abstract
Kakuro puzzles, also called cross sum puzzles, are grids containing clues to the completion of numerical ‘words’. Being structured in a similar way to crossword puzzles, Kakuro grids contain overlapping continuous runs that are exclusively either horizontal or vertical. The ‘clues’ take the form of specified run totals, and a puzzle is solved by placing a value in each cell such that every run sums to its specified total, and no run contains duplicate values. While most puzzles have only a single solution, longer runs may be satisfied using many arrangements of values, leading to the puzzle having a deceptively large search space. The associated, popular Sudoku puzzle has been linked with important real-world applications including timetabling and conflict free wavelength routing, and more recently, coding theory due to its potential usefulness in the construction of erasure correction codes. It is possible that Kakuro puzzles will have similar applications, particularly in the construction of codes, where run totals may form a generalised type of parity check. A project has begun to investigate the properties of the class of Kakuro puzzles, and thereby establish its potential usefulness to real-world applications including coding theory. This paper reports some early findings from that project, specifically concerning puzzle complexity and the appropriateness of heuristic approaches for its automated solution. It highlights the use of heuristics to guide search by a backtracking solver, in preference to local search optimisation, and reports on the effectiveness of two heuristics and a pruning technique for reducing solution time. The authors believe this to be the first published work in the use of heuristics, in combination with pruning, for the automated solution of Kakuro puzzles.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Cadoli, M., Schaerf, M.: Partial solutions with unique completion. Lect. Notes Comput. Sci. 4155, 101–10, (2006)
Chandrasekaran, K R: Kakuro Puzzle Solver, Internal Report (2008) http://www.geocities.com/krcgee/kakuro/index.html
Davies, R.P., Roach P.A., Perkins, S.: Properties of, and Solutions to, Kakuro and related puzzles. In: Roach, P., Plassman, P. (eds.) Proceedings of the 3rd Research Student Workshop, University of Glamorgan, pp. 54–58 (2008)
Dotu, I., del Val, A., Cebrian, M.: Redundant modeling for the quasigroup completion problem. In: Rossi, F. (ed.). Principles and Practice of Constraint Programming, CP 2003 (Lect. Notes Comput. Sci. 2833), Springer-Verlag, Berlin, pp 288–302 (2003)
Galanti, G.: The History of Kakuro,. Conceptis Puzzles (2005). http://www.conceptispuzzles.com/articles/kakuro/history.htm. Cited 22 Feb 2008
Gomes, C., Shmoys, D.: The promise of LP to boost CP techniques for combinatorial problems. In: Jussien, N., Laburthe, F. (eds.) Proceedings of the Fourth International Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimisation Problems, CPAIOR, France, pp 291–305 (2002)
Jones, S.K., Roach P.A., Perkins S.: Construction of heuristics for a search-based approach to solving Sudoku. In: Bramer M., Coenen F., Petridis M. (eds) Research and Development in Intelligent Systems XXIV: Proceedings of AI-2007, the Twenty-seventh SGAI International Conference on Artificial Intelligence, pp. 37–49 (2007)
Kakuro Play: Kakuro Solver. Internal Report (2006) http://kakuro-solver.blogspot.com/
Mustonen, M.: On certain Cross Sum puzzles. Internal Report (2006) http://www.survo.fi/papers/puzzles.pdf. Cited 22 Feb 2008
Rich, E., Knight, K.: Artificial Intelligence, 2nd Edition. McGraw-Hill, Singapore (1991)
Seta, T.: The complexities of puzzles, cross sum and their another solution problems (ASP),. Senior thesis. Dept. Information Science, University of Tokyo (2002)
Soedarmadji, E., McEliece, R.: Iterative decoding for Sudoku and Latin Square codes. In: Forty-Fifth Annual Allerton Conference, Allerton-07, University of Illinois (2007)
Yang, X.: Cryptic Kakuro and Cross Sums Sudoku. Exposure Publishing (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag London Limited
About this paper
Cite this paper
Davies, R.P., Roach, P.A., Perkins, S. (2009). Automation of the Solution of Kakuro Puzzles. In: Bramer, M., Petridis, M., Coenen, F. (eds) Research and Development in Intelligent Systems XXV. SGAI 2008. Springer, London. https://doi.org/10.1007/978-1-84882-171-2_16
Download citation
DOI: https://doi.org/10.1007/978-1-84882-171-2_16
Publisher Name: Springer, London
Print ISBN: 978-1-84882-170-5
Online ISBN: 978-1-84882-171-2
eBook Packages: Computer ScienceComputer Science (R0)