Col is PSPACE-complete on Triangular Grids

Kyle Burke, Craig Tennenhouse

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…