A genetic algorithm for the Zen Puzzle Garden game

Amos, Martyn and Coldridge, Jack (2012) A genetic algorithm for the Zen Puzzle Garden game. Natural Computing, 11 (3). pp. 353-359. ISSN 1567-7818

Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/s11047-011-9284-7


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.

Item Type: Article
Uncontrolled Keywords: Genetic algorithm, Transport puzzle, NP-complete, Game A*
Subjects: G900 Others in Mathematical and Computing Sciences
Department: Faculties > Engineering and Environment > Computer and Information Sciences
Depositing User: Becky Skoyles
Date Deposited: 20 Feb 2019 09:37
Last Modified: 10 Oct 2019 23:31
URI: http://nrl.northumbria.ac.uk/id/eprint/38129

Actions (login required)

View Item View Item


Downloads per month over past year

View more statistics