Ice Walk is ASP-Complete
arXiv:2607.22224
Abstract
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 of a rectangular grid graph bijectively to Ice Walk solutions.
4 pages, 1 figures