Defying gravity and gadget numerosity: the complexity of the Hanano puzzle

DOI10.1007/978-3-031-34326-1_3arXiv2205.03400OpenAlexW4381895102MaRDI QIDQ6175086

Michael C. Chavrimootoo

Publication date: 17 August 2023

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2205.03400

zbMATH Keywords

computational complexityhardness of gamesirreversible gamesminimizing gadgets

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• A unified approach to visibility representations of planar graphs
• \textsc{Hanano} puzzle is \textsf{NP}-hard
• PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
• On the complexity of jelly-no-puzzle
• TETRIS IS HARD, EVEN TO APPROXIMATE
• Super Mario Bros. Is Harder/Easier than We Thought
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Defying gravity and gadget numerosity: the complexity of the Hanano puzzle