CCMar 17
Wataridori is NP-Complete
arXiv:2601.0934561.9h-index: 9
AI Analysis
This result establishes the computational complexity of Wataridori, a specific pencil puzzle, which is incremental as it builds on prior work on Numberlink.
The paper proves that deciding whether a given Wataridori puzzle has a solution is NP-complete by reducing it from Numberlink, a known NP-complete pencil puzzle.
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.