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):
Displaying 15 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)
- \textsf{PSPACE}-complete two-color planar placement games (Q2002060) (← links)
- QUIXO is EXPTIME-complete (Q2203590) (← links)
- On the fairness and complexity of generalized \(k\)-in-a-row games (Q2456362) (← links)
- Computational complexity of generalized Push Fight (Q3305729) (← links)
- (Q3305770) (← links)
- <i>N</i> by <i>N</i> Checkers is Exptime Complete (Q3316590) (← links)
- Games, Puzzles and Treewidth (Q5042461) (← links)
- Computational complexity of puzzles and related topics (Q6535387) (← links)
- The computational complexity of forced capture Hnefatafl (Q6562456) (← links)
- Cognitive and computational complexity: considerations from mathematical problem solving (Q6652877) (← links)