Aviezri S. Fraenkel, David Lichtenstein. Computing a Perfect Strategy for n*n Chess Requires Time Exponential in N. In Shimon Even, Oded Kariv, editors, Automata, Languages and Programming, 8th Colloquium, Acre (Akko), Israel, July 13-17, 1981, Proceedings. Volume 115 of Lecture Notes in Computer Science, pages 278-293, Springer, 1981.
@inproceedings{FraenkelL81,
title = {Computing a Perfect Strategy for n*n Chess Requires Time Exponential in N},
author = {Aviezri S. Fraenkel and David Lichtenstein},
year = {1981},
researchr = {https://researchr.org/publication/FraenkelL81},
cites = {0},
citedby = {0},
pages = {278-293},
booktitle = {Automata, Languages and Programming, 8th Colloquium, Acre (Akko), Israel, July 13-17, 1981, Proceedings},
editor = {Shimon Even and Oded Kariv},
volume = {115},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-10843-2},
}