arXiv:1106.2104cs.CC
Zen Puzzle Garden is NP-complete
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.
On Hacker News
Linked by 2 identifiable commenters in 3 comments across 3 threads, from Oct 2011 to Oct 2026. Found in 1 HN submission from May 2020 to May 2020. Open submission discussions.
Discussed in comments3 threads
-
-
Similar examples: https://news.ycombinator.com/item?id=9022021 https://news.ycombinator.com/item?id=1315551 https://news.ycombinator.com/item?id=10317224 https://news.ycombinator.com/item?id=9645845 https://news.ycombinator.com/item?id=10574895…
-
-
-
In a selfish sort of way, I hope this discussion doesn’t end up being completely dominated by the question of whether the “Humble Bundle” offers are going downhill or whether their web page is well enough designed. I’d like to see Voxatron succeed, not only because it’s the most…
-
Submitted to Hacker News
Also discussed alongside
Connected through shared HN threads, not inferred similarity or a recommendation.
I really liked Zen Puzzle Garden back in the day. I spent a lot of time playing it when I ought to have been working on my PhD, and I even ended up writing a paper on it. [0] It’s interesting that Gwern explicitly mentions ZPG as an inferior predecessor, because – for reasons I…
robinhoustonView on HNParent context