TL;DR
This paper proves that solving the Wataridori puzzle is NP-complete by reducing from the known NP-complete problem Numberlink, establishing its computational complexity.
Contribution
It introduces the first complexity proof for Wataridori, showing it is NP-complete through a reduction from Numberlink.
Findings
Wataridori is NP-complete.
Deciding Wataridori solutions is computationally hard.
Complexity proof connects Wataridori to other NP-complete puzzles.
Abstract
Wataridori is a pencil puzzle that involves drawing paths in a rectangular grid to connect circles into pairs while satisfying several constraints. In this paper, we prove that deciding whether a given Wataridori puzzle has a solution is NP-complete via a reduction from Numberlink, another pencil puzzle that has previously been proved NP-complete.
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
TopicsComputational Geometry and Mesh Generation · Digital Image Processing Techniques · Geometric and Algebraic Topology