Zen Puzzle Garden is NP-complete

Robin Houston, Joseph White, Martyn Amos*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

6 Citations (Scopus)

Abstract

Zen Puzzle Garden is a commercial computer puzzle game. We prove that deciding the solvability of the game is NP-complete. The game therefore provides a useful test-bed for new automatic solving methods.

Original languageEnglish
Pages (from-to)106-108
Number of pages3
JournalInformation Processing Letters
Volume112
Issue number3
DOIs
Publication statusPublished - 31 Jan 2012

Fingerprint Dive into the research topics of 'Zen Puzzle Garden is NP-complete'. Together they form a unique fingerprint.

Cite this