Monte-Carlo Kakuro

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.

• Type: Conference
• Year: 2009
• Where: ACG
• Authors: Tristan Cazenave
• Keywords: ACG 2009, Computer Graphics, Constraint Satisfaction Problem, Kakuro, Nested Monte-Carlo Search