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.

翻译：笔谜是指仅通过逻辑推理在纸上写下解答即可求解的谜题。本文利用Tang与MIT Hardness Group开发的“T-metacell”框架，证明了四种新型笔谜的NP完全性：Grand Tour、Entry Exit、Zahlenschlange与Yagit。此外，前三种谜题亦被证明是ASP完全的。这些结果表明该框架具有广泛适用性，为理解具有多种约束条件问题的计算复杂度提供了新的视角。