On some impossible disentanglement puzzles
Fernando Galve Mauricio
TL;DR
This paper proves the impossibility of certain disentanglement puzzles by constructing mathematical models that capture their essential features.
Contribution
It introduces mathematical models to demonstrate the fundamental impossibility of solving specific disentanglement puzzles.
Findings
Certain puzzles are mathematically proven impossible to solve.
Models accurately reflect puzzle constraints and characteristics.
Provides a theoretical foundation for understanding puzzle limitations.
Abstract
In this article we prove the impossibility of some disentanglement puzzles, first building mathematical models that reflect the essential characteristics of these puzzles.
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
TopicsGeometric and Algebraic Topology · Digital Image Processing Techniques · Computational Geometry and Mesh Generation