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 Constraint Logic and NoGo is shown to be hard directly from Col.
Cite
@article{arxiv.1602.06012,
title = {PSPACE-Complete Two-Color Placement Games},
author = {Kyle Burke and Bob Hearn},
journal= {arXiv preprint arXiv:1602.06012},
year = {2016}
}