Year: 2025
Type: preprint
Abstract: 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.
Source: arXiv (Cornell University)
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7124299176
Cites:
Cited by:
Related to: