On the complexity of jelly-no-puzzle

DOI10.1007/978-3-030-90048-9_13OpenAlexW3210970463MaRDI QIDQ2695482

Yanyan Li

Publication date: 31 March 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-90048-9_13

zbMATH Keywords

computational complexitymotion planningcombinatorial puzzles\textsf{NP}-complete

Mathematics Subject Classification ID

Applications of game theory (91A80) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

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

Cites Work

• \textsc{Hanano} puzzle is \textsf{NP}-hard
• Assembling molecules in ATOMIX is hard
• TETRIS IS HARD, EVEN TO APPROXIMATE
• Reducibility among Combinatorial Problems
• Unnamed Item
• Unnamed Item

This page was built for publication: On the complexity of jelly-no-puzzle