Gobang is PSPACE-complete

DOI10.1007/BF00288536zbMATH Open0401.90112WikidataQ29999401 ScholiaQ29999401MaRDI QIDQ1255445FDOQ1255445

Authors: Stefan Reisch 

Publication date: 1980

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

Computational ComplexityGeographyGobangPspace-Completeness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05)

Cites Work

• Title not available (Why is that?)
• On the complexity of some two-person perfect-information games

Cited In (11)

• Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete.
• Title not available (Why is that?)
• Computing a perfect strategy for nxn chess requires time exponential in n
• Rikudo is NP-complete
• Recent results and questions in combinatorial game complexities
• The Othello game on an \(n\times n\) board is PSPACE-complete
• An algorithmic analysis of the Honey-Bee game
• Theory of annihilation games. I
• Quantified Boolean Solving for Achievement Games
• On the fairness and complexity of generalized \(k\)-in-a-row games
• QUIXO is EXPTIME-complete

This page was built for publication: Gobang is PSPACE-complete

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1255445)