论文信息 - Solving SameGame and its Chessboard Variant

Solving SameGame and its Chessboard Variant

We introduce a new solving method for SameGame puzzles based on Monte-Carlo simulation, that improves the previous best known method. We also cover the ches sboard variant, a subclass of the SameGame puzzle for which we can exactly define which puzzles are solva ble nd which ones are not. Next to this we present a quantitative approach to classify the difficult y of a given puzzle, as well as an indication of whether or not a given puzzle is solvable.

Walter A. Kosters | Frank W. Takes | W. Kosters

[1] Maarten P. D. Schadd,et al. Addressing NP-Complete Puzzles with Monte-Carlo Methods 1 , 2008 .

[2] Erik D. Demaine,et al. The Complexity of Clickomania , 2001, ArXiv.

[3] Graham Kendall,et al. A Survey of NP-Complete Puzzles , 2008, J. Int. Comput. Games Assoc..

[4] Csaba Szepesvári,et al. Bandit Based Monte-Carlo Planning , 2006, ECML.

[5] Frank W. Takes. Sokoban: Reversed Solving , 2008 .

[6] Erik D. Demaine,et al. Games of No Chance 3: Playing games with algorithms: Algorithmic combinatorial game theory , 2009 .

[7] Peter Norvig,et al. Artificial Intelligence: A Modern Approach , 1995 .

[8] Stuart J. Russell,et al. Artificial Intelligence , 1999 .