加载中…
2011-06-10
Zen Puzzle Garden is NP-complete
Robin HoustonJoseph WhiteMartyn Amos
文献摘要
Zen Puzzle Garden (ZPG) is a one-player puzzle game. In this paper, we prove that deciding the solvability of ZPG is NP-complete.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本