Zen puzzle garden is NP-complete

DOI10.1016/j.ipl.2011.10.016zbMath1233.68140OpenAlexW2041446603MaRDI QIDQ763503

D. Kharzeev

Publication date: 9 March 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.10.016

zbMATH Keywords

puzzlecomputational complexityNP-completenessone-player puzzle game

Mathematics Subject Classification ID

Game theory (91A99) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

\textsc{Hanano} puzzle is \textsf{NP}-hard ⋮ A genetic algorithm for the zen puzzle garden game

Cites Work

• Unnamed Item
• How to draw a planar graph on a grid
• Sokoban: Improving the search with relevance cuts
• A genetic algorithm for the zen puzzle garden game
• Applying genetic algorithms to game search trees
• The Planar Hamiltonian Circuit Problem is NP-Complete

This page was built for publication: Zen puzzle garden is NP-complete