2 papers
cs.CC2026
Ice Walk is ASP-Complete
Papangkorn Apinyanon
We prove that the solution-search problem for the pencil puzzle Ice Walk is ASP-complete. Our reduction maps Hamiltonian cycles in an undirected maximum-degree-3 spanning subgraph…
cs.CC2025
NP-Completeness Proofs of All or Nothing, Water Walk, and Remembered Length Using the T-Metacell Framework
Pakapim Eua-anant, Papangkorn Apinyanon, Thunyatorn Jirachaisri +2
All or Nothing, Water Walk, and Remembered Length are pencil puzzles that involve constructing a continuous loop on a rectangular grid under specific constraints. In this paper, we…