arXiv 1106.21042011-06-10cs.CC

禅迷园是NP完全的

Zen Puzzle Garden is NP-complete

Robin Houston, Joseph White, Martyn Amos

摘要：

Zen Puzzle Garden（ZPG）是一款单人益智游戏。本文证明了判定ZPG的可解性是NP-完全的。

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

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。