[PDF][PDF] Zen puzzle garden is NP-complete
R Houston, J White, M Amos - arXiv preprint arXiv:1106.2104, 2011 - arxiv.org
R Houston, J White, M Amos
arXiv preprint arXiv:1106.2104, 2011•arxiv.orgarXiv:1106.2104v1 [cs.CC] 10 Jun 2011 Page 1 arXiv:1106.2104v1 [cs.CC] 10 Jun 2011 Zen
Puzzle Garden is NP-complete Robin Houstona, Joseph Whiteb, Martyn Amosc amySociety
Ltd., London, United Kingdom. bLexaloffle Games, Wellington, New Zealand. cSchool of
Computing, Mathematics and Digital Technology, Manchester Metropolitan University, United
Kingdom. Keywords: Computational complexity; NP-completeness; Puzzle. 1. Introduction Zen
Puzzle Garden (ZPG) is a one-player puzzle game that takes place on a two-dimensional grid …
Puzzle Garden is NP-complete Robin Houstona, Joseph Whiteb, Martyn Amosc amySociety
Ltd., London, United Kingdom. bLexaloffle Games, Wellington, New Zealand. cSchool of
Computing, Mathematics and Digital Technology, Manchester Metropolitan University, United
Kingdom. Keywords: Computational complexity; NP-completeness; Puzzle. 1. Introduction Zen
Puzzle Garden (ZPG) is a one-player puzzle game that takes place on a two-dimensional grid …
Zen Puzzle Garden (ZPG) is a one-player puzzle game. In this paper, we prove that deciding the solvability of ZPG is NP-complete.
arxiv.org