scientific article; zbMATH DE number 7765375

DOI10.4230/lipics.isaac.2020.17arXiv2010.09271MaRDI QIDQ6065414

Dylan Hendrickson, Erik D. Demaine, Unnamed Author, Julian Wellman

Publication date: 14 November 2023

Full work available at URL: https://arxiv.org/abs/2010.09271

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

hardnessPSPACEboard games

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items

Chess Equilibrium Puzzles

Cites Work

• On the complexity of chess
• Computing a perfect strategy for nxn chess requires time exponential in n
• The Diameter of Chess Grows Exponentially
• Unnamed Item