@InProceedings{brunner_et_al:LIPIcs.ISAAC.2020.17,
author = {Brunner, Josh and Demaine, Erik D. and Hendrickson, Dylan and Wellman, Julian},
title = {{Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess Is Hard}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {17:1--17:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.17},
URN = {urn:nbn:de:0030-drops-133618},
doi = {10.4230/LIPIcs.ISAAC.2020.17},
annote = {Keywords: hardness, board games, PSPACE}
}