Genetic algorithms and the art of Zen

In this paper we present a novel genetic algorithm (GA) solution to a simple yet challenging commercial puzzle game known as the Zen Puzzle Garden (ZPG). We describe the game in detail, before presenting a suitable encoding scheme and fitness function for candidate solutions. We then compare the per...

Full description

Saved in:
Bibliographic Details
Main Authors Coldridge, Jack, Amos, Martyn
Format Journal Article
LanguageEnglish
Published 24.05.2010
Subjects
Computer Science - Artificial Intelligence
Computer Science - Neural and Evolutionary Computing
Online AccessGet full text
DOI10.48550/arxiv.1005.4446

Cover

More Information
Summary:In this paper we present a novel genetic algorithm (GA) solution to a simple yet challenging commercial puzzle game known as the Zen Puzzle Garden (ZPG). We describe the game in detail, before presenting a suitable encoding scheme and fitness function for candidate solutions. We then compare the performance of the genetic algorithm with that of the A* algorithm. Our results 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. We conclude with a brief discussion of the implications of our findings for game solving and other "real world" problems.
Bibliography:2010/5/1
DOI:10.48550/arxiv.1005.4446