\textsf{PSPACE}-complete two-color planar placement games

DOI10.1007/s00182-018-0628-8zbMath1417.91142OpenAlexW2884420748MaRDI QIDQ2002060

Robert A. Hearn, Kyle Burke

Publication date: 11 July 2019

Published in: International Journal of Game Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00182-018-0628-8

zbMATH Keywords

complexitycombinatorial game\textsf{PSPACE}

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial games (91A46)

Cites Work

• On the complexity of some two-person perfect-information games
• Game Values and Computational Complexity: An Analysis via Black-White Combinatorial Games
• Playing Games with Algorithms: Algorithmic Combinatorial Game Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: \textsf{PSPACE}-complete two-color planar placement games