Zen puzzle garden is NP-complete

DOI10.1016/J.IPL.2011.10.016MaRDI QIDQ763503zbMATH OpenOpenAlexFDO

Authors 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

computational complexityNP-completenessone-player puzzle gamepuzzle

Mathematics Subject Classification ID

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

Cites work

• A genetic algorithm for the zen puzzle garden game
• Applying genetic algorithms to game search trees
• How to draw a planar graph on a grid
• scientific article; zbMATH DE number 1834637 (Why is no real title available?)
• Sokoban: Improving the search with relevance cuts
• The Planar Hamiltonian Circuit Problem is NP-Complete

Cited in

(2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q763503)