The following pages link to Gobang is PSPACE-complete (Q1255445):
Displayed 10 items.
- An algorithmic analysis of the Honey-Bee game (Q714789) (← links)
- Computing a perfect strategy for nxn chess requires time exponential in n (Q1156090) (← links)
- Theory of annihilation games. I (Q1168901) (← links)
- The Othello game on an \(n\times n\) board is PSPACE-complete (Q1314386) (← links)
- Recent results and questions in combinatorial game complexities (Q1583532) (← links)
- Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete. (Q1853560) (← links)
- Rikudo is NP-complete (Q2118858) (← links)
- QUIXO is EXPTIME-complete (Q2203590) (← links)
- On the fairness and complexity of generalized \(k\)-in-a-row games (Q2456362) (← links)
- (Q3305770) (← links)