A genetic algorithm for the Zen Puzzle Garden game

In this paper we present a novel genetic algorithm (GA) solution to a simple yet challenging commercial puzzle game known as Zen Puzzle Garden (ZPG). We describe the game in detail, before presenting a suitable encoding scheme and fitness function for candidate solutions. By constructing a simulator for the game, we compare the performance of the GA with that of the A* algorithm. We show that the GA is competitive with informed search in terms of solution quality, and significantly out-performs it in terms of computational resource requirements. By highlighting relevant features of the game we hope to stimulate further work on its study, and we conclude by presenting several possible areas for future research.

[1]  W. Marsden.  I and J , 2012 .

[2]  Tzung-Pei Hong,et al.  Applying genetic algorithms to game search trees , 2002, Soft Comput..

[3]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[4]  James H. Lawton,et al.  Multi-agent Planning in Sokoban , 2007, CEEMAS.

[5]  Richard E. Korf,et al.  Finding Optimal Solutions to Rubik's Cube Using Pattern Databases , 1997, AAAI/IAAI.

[6]  Roger Scruton,et al.  The Art of Motorcycle Maintenance , 1987 .

[7]  Jonathan Schaeffer,et al.  Sokoban: improving the search with relevance cuts , 2001, Theor. Comput. Sci..

[8]  Michael Hoffmann,et al.  Pushing blocks is np-complete for noncrossing solution paths , 2001, CCCG.

[9]  David E. Goldberg,et al.  Zen and the Art of Genetic Algorithms , 1989, ICGA.

[10]  Jonathan Schaeffer,et al.  Sokoban: Enhancing general single-agent search methods using domain knowledge , 2001, Artif. Intell..

[11]  Jonathan Schaeffer,et al.  Sokoban: A Challenging Single-Agent Search Problem , 1997, IJCAI 1997.

[12]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[13]  Teddie McFerrin.  Robert M. Pirsig's "Zen and the Art of Motorcycle Maintenance": An Inquiry Into Teaching Techniques. , 1976 .

[14]  Rina Dechter,et al.  Generalized best-first search strategies and the optimality of A* , 1985, JACM.

[15]  A. Rubinstein,et al.  A Course in Game Theory , 1995 .

[16]  Jonathan Schaeffer,et al.  Using Abstraction for Planning in Sokoban , 2002, Computers and Games.

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

[18]  Graham Kendall,et al.  Scripting the game of Lemmings with a genetic algorithm , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[19]  Uri Zwick,et al.  SOKOBAN and other motion planning problems , 1999, Comput. Geom..

[20]  Martyn Amos,et al.  Zen Puzzle Garden is NP-complete , 2012, Inf. Process. Lett..

[21]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[22]  美克 五十嵐,et al.  Robert M.Pirsig's "Zen and the Art of Motorcycle Maintenance"--「クオリティ」と「無分別」の関係性を探る , 2009 .

[23]  Timo Mantere,et al.  Solving, rating and generating Sudoku puzzles with GA , 2007, 2007 IEEE Congress on Evolutionary Computation.