Zen Puzzle Garden is NP-complete
classification
💻 cs.CC
keywords
puzzlegardennp-completedecidinggameone-playerprovesolvability
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.