Josh Brunner, Erik D. Demaine, Dylan H. Hendrickson, Julian Wellman. Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess Is Hard. In Yixin Cao 0001, Siu-Wing Cheng, Minming Li, editors, 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference). Volume 181 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. [doi]
@inproceedings{BrunnerDHW20, title = {Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess Is Hard}, author = {Josh Brunner and Erik D. Demaine and Dylan H. Hendrickson and Julian Wellman}, year = {2020}, doi = {10.4230/LIPIcs.ISAAC.2020.17}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.17}, researchr = {https://researchr.org/publication/BrunnerDHW20}, cites = {0}, citedby = {0}, booktitle = {31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, editor = {Yixin Cao 0001 and Siu-Wing Cheng and Minming Li}, volume = {181}, series = {LIPIcs}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, isbn = {978-3-95977-173-3}, }