Cardinal Grid Slime Trail is PSPACE-Complete
Abstract
Slime Trail is a two-player combinatorial game in which the players alternately move a shared token to an adjacent vertex, permanently removing each vertex the token leaves, while attempting to reach a goal node. Ferland and Burke (2017) proved that Slime Trail is PSPACE-complete on arbitrary planar graphs and asked whether the same holds for the grid version actually used in play. We resolve this open problem by proving that Cardinal Grid Slime Trail, that is, Slime Trail on a square grid with four-directional movement, is PSPACE-complete. We adapt their QBF reduction to the grid setting, designing grid-compatible gadgets that respect the degree-4 bound and the parity constraints of the integer lattice. We further show the construction extends, under a 45-degree rotation, to the eight-directional variant.
Cite
@article{arxiv.2608.05118,
title = {Cardinal Grid Slime Trail is PSPACE-Complete},
author = {Anne Pham and Matthew Ferland},
journal= {arXiv preprint arXiv:2608.05118},
year = {2026}
}