NP-Completeness Proofs of Puzzles using the T-Metacell Framework
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908762815594496 |
|---|---|
| author | Kiatchaipipat, Nattapol Ruangwises, Suthee |
| author_facet | Kiatchaipipat, Nattapol Ruangwises, Suthee |
| contents | Pencil puzzles are puzzles that can be solved by writing down solutions on a paper, using only logical reasoning. In this paper, we utilize the "T-metacell" framework developed by Tang and the MIT Hardness Group to prove the NP-completeness of four new pencil puzzles: Grand Tour, Entry Exit, Zahlenschlange, and Yagit. Additionally, the first three are also proven to be ASP-complete. The results demonstrate how versatile the framework is, offering new insights into the computational complexity of problems with various constraints. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_11570 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | NP-Completeness Proofs of Puzzles using the T-Metacell Framework Kiatchaipipat, Nattapol Ruangwises, Suthee Computational Complexity F.2.2 Pencil puzzles are puzzles that can be solved by writing down solutions on a paper, using only logical reasoning. In this paper, we utilize the "T-metacell" framework developed by Tang and the MIT Hardness Group to prove the NP-completeness of four new pencil puzzles: Grand Tour, Entry Exit, Zahlenschlange, and Yagit. Additionally, the first three are also proven to be ASP-complete. The results demonstrate how versatile the framework is, offering new insights into the computational complexity of problems with various constraints. |
| title | NP-Completeness Proofs of Puzzles using the T-Metacell Framework |
| topic | Computational Complexity F.2.2 |
| url | https://arxiv.org/abs/2508.11570 |