PSPACE-完整的双色放置游戏
PSPACE-Complete Two-Color Placement Games
摘要：
我们表明，三个放置游戏，科尔，NoGo和峡湾，是PSPACE完全平面图。Col和Fjords的硬度通过Bounded 2-Player约束逻辑的简化显示，NoGo直接从Col显示为硬。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
