Abstract
Kakuro consists in filling a grid with integers that sum up to predefined values. Sums are predefined for each row and column and all integers have to be different in the same row or column. Kakuro can be modeled as a constraint satisfaction problem. Monte-Carlo methods can improve on traditional search methods for Kakuro. We show that a Nested Monte-Carlo Search at level 2 gives good results. This is the first time a nested search of level 2 gives good results for a Constraint Satisfaction problem. © 2010 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Cazenave, T. (2010). Monte-Carlo Kakuro. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6048 LNCS, pp. 45–54). Springer Verlag. https://doi.org/10.1007/978-3-642-12993-3_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
