Wataridori is NP-Complete
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.
Fields of Study & Subjects
Advanced Graph Theory Research
Complexity and Algorithms in Graphs
Constraint Satisfaction and Optimization
Publication details
- Journal / source
- arXiv (Cornell University)
- Publication date
- 14 January 2026
- Document type
- Preprint