Zen Puzzle Garden is NP-complete
Robin Houston, Joseph White, Martyn Amos
TL;DR
This paper proves that determining whether a Zen Puzzle Garden (ZPG) puzzle can be solved is an NP-complete problem, highlighting its computational complexity.
Contribution
The paper establishes that ZPG's solvability decision problem is NP-complete, providing a complexity classification for this puzzle game.
Findings
ZPG is NP-complete.
Deciding solvability is computationally hard.
Complexity classification of ZPG.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsArtificial Intelligence in Games · Computational Geometry and Mesh Generation · Robotic Path Planning Algorithms