Ice Walk is ASP-Complete

Papangkorn Apinyanon

Ice Walk is ASP-Complete

Computational Complexity 2026-07-24 v1

Authors: Papangkorn Apinyanon

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.

Cite

@article{arxiv.2607.22224,
  title  = {Ice Walk is ASP-Complete},
  author = {Papangkorn Apinyanon},
  journal= {arXiv preprint arXiv:2607.22224},
  year   = {2026}
}

Comments

4 pages, 1 figures