Chess is hard even for a single player

DOI10.1016/J.TCS.2024.114726MaRDI QIDQ6614005zbMATH OpenFDO

Authors N. R. Aravind, Neeldhara Misra, Harshil Mittal

Publication date 7 October 2024

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

NP-completenesscombinatorial gamessolo chess

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 7765375 (Why is no real title available?)
• Computing a perfect strategy for nxn chess requires time exponential in n
• PSPACE-Hardness of some combinatorial games
• Parameterized algorithms
• The complexity of pursuit on a graph
• Winning ways for your mathematical plays. Vol. 1.

This page was built for publication: Chess is hard even for a single player

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