On the complexity of chess

DOI10.1016/0022-0000(83)90030-2MaRDI QIDQ1054641zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• A Combinatorial Problem Which Is Complete in Polynomial Space
• Computing a perfect strategy for nxn chess requires time exponential in n
• Efficient Planarity Testing
• scientific article; zbMATH DE number 3560737 (Why is no real title available?)
• scientific article; zbMATH DE number 3589730 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3449757 (Why is no real title available?)

Cited in

(7)

• Applying adversarial planning techniques to Go
• TANTRIX\(^{\text{TM}}\) rotation puzzles are intractable
• The set coincidence game: Complexity, attainability, and symmetric strategies
• scientific article; zbMATH DE number 7765375 (Why is no real title available?)
• Chess Equilibrium Puzzles
• Complexity of solo chess with unlimited moves
• Uniform-budget solo chess with only rooks or only knights is hard

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1054641)