π€ AI Summary
This paper investigates the computational complexity of the combinatorial game Col on triangular grid graphs, establishing that its winnability problem is PSPACE-complete. We achieve this via a polynomial-time reduction from Bounded 2-Player Constraint Logic, the first such hardness proof for Col on triangular gridsβa highly symmetric, regular geometric graph family. Our construction rigorously encodes constraint logic gadgets within the structural constraints of triangular lattices, preserving game equivalence under optimal play. This result resolves an open question regarding Colβs complexity on geometrically structured graphs, filling a key theoretical gap in the complexity landscape of positional games. Moreover, triangular grids constitute the most regular and geometrically uniform graph family known to be PSPACE-hard for Col, surpassing previously identified instances in structural regularity. The work thus advances the classification of combinatorial games on structured graphs, providing both a new hardness benchmark and methodological insights for complexity analysis of games under geometric constraints.
π Abstract
We demonstrate that Col is PSPACE-complete on triangular grid graphs via a reduction from Bounded Two-Player Constraint Logic. This is the most structured graph family that Col is known to be computationally hard for.