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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bjarnason, R., Tadepalli, P., Fern, A.: Searching solitaire in real time. ICGA Journal 30(3), 131–142 (2007)
Cazenave, T.: Reflexive Monte-Carlo search. In: Computer Games Workshop, Amsterdam, The Netherlands, pp. 165–173 (2007)
Cazenave, T.: Nested Monte-Carlo search. In: IJCAI 2009, Pasadena, USA, pp. 456–461 (2009)
Cazenave, T., Jouandeau, N.: Parallel nested Monte-Carlo search. In: NIDISC Workshop, Rome, Italy (2009)
Kendall, G., Parkes, A., Spoerer, K.: A survey of NP-complete puzzles. ICGA Journal 31(1), 13–34 (2008)
Tesauro, G., Galperin, G.: On-line policy improvement using monte-carlo search. In: Advances in Neural Information Processing Systems, vol. 9, pp. 1068–1074. MIT Press, Cambridge (1996)
Yan, X., Diaconis, P., Rusmevichientong, P., Roy, B.V.: Solitaire: Man versus machine. In: Advances in Neural Information Processing Systems, vol. 17, pp. 1553–1560. MIT Press, Cambridge (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cazenave, T. (2010). Monte-Carlo Kakuro. In: van den Herik, H.J., Spronck, P. (eds) Advances in Computer Games. ACG 2009. Lecture Notes in Computer Science, vol 6048. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12993-3_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-12993-3_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12992-6
Online ISBN: 978-3-642-12993-3
eBook Packages: Computer ScienceComputer Science (R0)