HANANO Puzzle is NP-hard

作者：Liu, Ziwen; Yang, Chao^*

来源：Information Processing Letters, 2019, 145: 6-10.

DOI：10.1016/j.ipl.2019.01.003

• Combinatorial puzzles
• Computational complexity
• Hanano Puzzle
• NP-hard

We show that the HANANO Puzzle, a side-viewed 2-dimensional combinatorial puzzle with gravity and colored blocks, is NP-hard.

• 出版日期2019-5
• 单位中山大学; 华南理工大学