Pages that link to "Item:Q1314386"
From MaRDI portal
The following pages link to The Othello game on an \(n\times n\) board is PSPACE-complete (Q1314386):
Displayed 6 items.
- On the complexity of connection games (Q307770) (← links)
- Phutball is PSPACE-hard (Q410721) (← links)
- An algorithmic analysis of the Honey-Bee game (Q714789) (← links)
- Automated verification of state sequence invariants in general game playing (Q1761287) (← links)
- Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete. (Q1853560) (← links)
- On the fairness and complexity of generalized \(k\)-in-a-row games (Q2456362) (← links)
