Wataridori is NP-Complete
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866908892577923072 |
|---|---|
| author | Ruangwises, Suthee |
| author_facet | Ruangwises, Suthee |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_09345 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Wataridori is NP-Complete Ruangwises, Suthee Computational Complexity 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. |
| title | Wataridori is NP-Complete |
| topic | Computational Complexity |
| url | https://arxiv.org/abs/2601.09345 |