\textsc{Hanano} puzzle is \textsf{NP}-hard

DOI10.1016/j.ipl.2019.01.003zbMath1446.68070OpenAlexW2910297665WikidataQ128563950 ScholiaQ128563950MaRDI QIDQ1730016

Ziwen Liu, Chao Yang

Publication date: 11 March 2019

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

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

zbMATH Keywords

computational complexityNP-hardnesscombinatorial puzzlesHanano puzzle

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle ⋮ Defying gravity and gadget numerosity: the complexity of the Hanano puzzle ⋮ On the complexity of jelly-no-puzzle

Cites Work

• Unnamed Item
• Computability and complexity theory.
• Zen puzzle garden is NP-complete
• Tetravex is NP-complete
• Hashiwokakero is NP-complete
• On the Complexity of Two Dots for Narrow Boards and Few Colors.

This page was built for publication: \textsc{Hanano} puzzle is \textsf{NP}-hard