1 citations · 1 across the 1 of their papers we have counts for
1 paper
Kyle Burke, Bob Hearn
We show that three placement games, Col, NoGo, and Fjords, are PSPACE-complete on planar graphs. The hardness of Col and Fjords is shown via a reduction from Bounded 2-Player Const…