Mathematical characterizations and computational complexity of anti-slide puzzles

DOI10.1007/978-3-030-68211-8_26zbMath1498.68358OpenAlexW3162363181MaRDI QIDQ5919108

Masao Hara, Ko Minamisawa, Ryuhei Uehara

Publication date: 4 October 2021

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-68211-8_26

zbMATH Keywords

convexitystrong NP-completenessanti-slide puzzleinterlock puzzle

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Polyominoes (05B50)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Covering convex sets with non-overlapping polygons
• Symmetric assembly puzzles are hard, beyond a few pieces

This page was built for publication: Mathematical characterizations and computational complexity of anti-slide puzzles