Computing a perfect strategy for nxn chess requires time exponential in n
From MaRDI portal
(Redirected from Publication:1156090)
Cites work
Cited in
(27)- Complexity of path-forming games
- A finite set of functions with an EXPTIME-complete composition problem
- Domino-tiling games
- On the complexity of computational problems associated with simple stochastic games
- Cognitive and computational complexity: considerations from mathematical problem solving
- Recent results and questions in combinatorial game complexities
- On variants of vertex geography on undirected graphs
- Computer Go: An AI oriented survey
- Games, Puzzles and Treewidth
- Theory of annihilation games. I
- The computational complexity of Angry Birds
- scientific article; zbMATH DE number 7765375 (Why is no real title available?)
- QUIXO is EXPTIME-complete
- Playing Savitch and cooking games
- On the complexity of chess
- Single-suit two-person card play
- Complexity, appeal and challenges of combinatorial games
- The Othello game on an \(n\times n\) board is PSPACE-complete
- Complexity of path discovery game problems
- Nimber-preserving reduction: game secrets and homomorphic Sprague-Grundy theorem
- An algorithmic analysis of the Honey-Bee game
- Remarks on history and presence of game tree search and research
- scientific article; zbMATH DE number 7232976 (Why is no real title available?)
- \textsc{Transverse wave}: an impartial color-propagation game inspired by social influence and quantum NIM
- A short certificate of the number of universal optimal strategies for stopping simple stochastic games
- Chess is hard even for a single player
- Hanabi is NP-hard, even for cheaters who look at their cards
This page was built for publication: Computing a perfect strategy for nxn chess requires time exponential in n
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1156090)
