Hamiltonicity in max-degree-3 grid graphs is ASP-complete, enabling a T-metacell framework that proves ASP-completeness for 38 loop puzzles, 14 previously unknown to be NP-hard.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
ASP-Completeness of Hamiltonicity in Grid Graphs, with Applications to Loop Puzzles
Hamiltonicity in max-degree-3 grid graphs is ASP-complete, enabling a T-metacell framework that proves ASP-completeness for 38 loop puzzles, 14 previously unknown to be NP-hard.