Zen Puzzle Garden is NP-complete
Zen Puzzle Garden (ZPG) is a one-player puzzle game. In this paper, we prove that deciding the solvability of ZPG is NP-complete.
cs.CC↗
arXiv subjects
Publications and source records attributed to Joseph White.
Zen Puzzle Garden (ZPG) is a one-player puzzle game. In this paper, we prove that deciding the solvability of ZPG is NP-complete.