3 papers
cs.CC2026
It's Hard to PArcK
Kyle Burke, Jeffrey Leman, Craig Tennenhouse
We show that Partizan Arc Kayles (PArcK), a generalization of Domineering to graphs, is PSPACE-complete via a reduction from Positive CNF and with recently-discovered techniques fo…
cs.CC2025
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…
cs.DS2016
Games from Basic Data Structures
Mara Bovee, Kyle Burke, Craig Tennenhouse
In this paper, we consider combinatorial game rulesets based on data structures normally covered in an undergraduate Computer Science Data Structures course: arrays, stacks, queues…