On the complexity of chess

DOI10.1016/0022-0000(83)90030-2zbMath0518.90096OpenAlexW2015319564MaRDI QIDQ1054641

James A. Storer

Publication date: 1983

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(83)90030-2

zbMATH Keywords

complexity of chessgeneralized chessP-space-completeness

Mathematics Subject Classification ID

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

Related Items (5)

Chess Equilibrium Puzzles ⋮ Unnamed Item ⋮ TANTRIX\(^{\text{TM}}\) rotation puzzles are intractable ⋮ The set coincidence game: Complexity, attainability, and symmetric strategies ⋮ Applying adversarial planning techniques to Go

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing a perfect strategy for nxn chess requires time exponential in n
• Efficient Planarity Testing
• A Combinatorial Problem Which Is Complete in Polynomial Space

This page was built for publication: On the complexity of chess