Col is PSPACE-complete on Triangular Grids
Kyle Burke, Craig Tennenhouse
TL;DR
This paper proves that the game Col remains PSPACE-complete even when restricted to triangular grid graphs, highlighting its computational complexity on highly structured graph families.
Contribution
It establishes the PSPACE-completeness of Col on triangular grid graphs, the most structured graph family known to be computationally hard for the game.
Findings
Col is PSPACE-complete on triangular grid graphs.
This is the first such hardness result on highly structured graphs.
The proof involves a reduction from Bounded Two-Player Constraint Logic.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.