Showing cs.CCShow all
3 papers · 1 filter
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.CC2023
Forced Capture Hnefatafl
Kyle Burke, Craig Tennenhouse
We define a new, partizan, loopy combinatorial game, Forced-Capture Hnefatafl, similar to Hnefatafl, except that players are forced to make capturing moves when available. We show…