A handle is enough for a hard game of Pull
Oscar Temprano
TL;DR
This paper proves that certain variants of the Pull puzzle, where boxes have handles restricting movement directions, are computationally NP-hard, highlighting the puzzle's increased complexity under these constraints.
Contribution
It introduces and analyzes a new variant of the Pull puzzle with handle constraints, establishing its NP-hardness.
Findings
Pull variants with handle constraints are NP-hard
Handle restrictions significantly increase puzzle complexity
Complexity results inform puzzle design and computational understanding
Abstract
We are going to show that some variants of a puzzle called Pull in which the boxes have handles (i.e. we can only pull the boxes in certain directions) are NP-hard
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsArtificial Intelligence in Games · Computational Geometry and Mesh Generation · Geometric and Algebraic Topology