Zen Puzzle Garden is NP-complete
arXiv:1106.2104
Abstract
Zen Puzzle Garden (ZPG) is a one-player puzzle game. In this paper, we prove that deciding the solvability of ZPG is NP-complete.
Submitted
arXiv:1106.2104
Zen Puzzle Garden (ZPG) is a one-player puzzle game. In this paper, we prove that deciding the solvability of ZPG is NP-complete.
Submitted