Slant/Gokigen Naname is NP-complete, and Some Variations are in P
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866909502164434944 |
|---|---|
| author | Lynch, Jayson Spalding-Jamieson, Jack |
| author_facet | Lynch, Jayson Spalding-Jamieson, Jack |
| contents | In this paper we show that a generalized version of the Nikoli puzzle Slant is NP-complete. We also give polynomial time algorithms for versions of the puzzle where some constraints are omitted. These problems correspond to simultaneously satisfying connectivity and vertex degree constraints in a grid graph and its dual. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_13536 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Slant/Gokigen Naname is NP-complete, and Some Variations are in P Lynch, Jayson Spalding-Jamieson, Jack Discrete Mathematics Computational Geometry Data Structures and Algorithms In this paper we show that a generalized version of the Nikoli puzzle Slant is NP-complete. We also give polynomial time algorithms for versions of the puzzle where some constraints are omitted. These problems correspond to simultaneously satisfying connectivity and vertex degree constraints in a grid graph and its dual. |
| title | Slant/Gokigen Naname is NP-complete, and Some Variations are in P |
| topic | Discrete Mathematics Computational Geometry Data Structures and Algorithms |
| url | https://arxiv.org/abs/2502.13536 |