A genetic algorithm for the zen puzzle garden game

DOI10.1007/S11047-011-9284-7zbMath1251.68195OpenAlexW2025423590MaRDI QIDQ1761727

Jack Coldridge, Martyn Amos

Publication date: 15 November 2012

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-011-9284-7

zbMATH Keywords

genetic algorithmNP-completegame A*transport puzzle

Mathematics Subject Classification ID

Game theory (91A99) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Zen puzzle garden is NP-complete

Uses Software

• JGAP

Cites Work

• Unnamed Item
• Zen puzzle garden is NP-complete
• Sokoban: Improving the search with relevance cuts
• SOKOBAN and other motion planning problems
• Applying genetic algorithms to game search trees
• Generalized best-first search strategies and the optimality of A*
• Sokoban: Enhancing general single-agent search methods using domain knowledge

This page was built for publication: A genetic algorithm for the zen puzzle garden game