Aviezri S. Fraenkel, David Lichtenstein
Computing a Perfect Strategy for n*n Chess Requires Time Exponential in N
ICALP, 1981.
@inproceedings{ICALP-1981-FraenkelL,
author = "Aviezri S. Fraenkel and David Lichtenstein",
booktitle = "{Proceedings of the Eighth Colloquium on Automata, Languages and Programming}",
doi = "10.1007/3-540-10843-2_23",
isbn = "3-540-10843-2",
pages = "278--293",
publisher = "{Springer-Verlag}",
series = "{Lecture Notes in Computer Science}",
title = "{Computing a Perfect Strategy for n*n Chess Requires Time Exponential in N}",
volume = 115,
year = 1981,
}