Abstract
It is proved that a natural generalization of chess to an n×n board is complete in exponential time. This implies that there exist chess-positions on an n×n chess-board for which the problem of determining who can win from that position requires an amount of time which is at least exponential in n.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Tis all a chequer-board of nights and days where destiny with men for pieces plays; hither and thither moves and mates and slays and one by one back in the closet lays.
The Rubaiyat of Omar Khayyam
Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
A.S. Fraenkel, M.R. Garey, D.S. Johnson, T. Schaefer and Y. Yesha, The complexity of checkers on an n×n board — preliminary report, Proc. 19th Annual Symp. on Foundations of Computer Science, 55–64, Ann Arbor, MI, October 1978; IEEE Computer Society, Long Beach, CA, 1978.
M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, San Francisco, 1979.
D. Lichtenstein and M. Sipser, Go is Polynomial-Space hard, J. ACM 27 (1980), 393–401. Also appeared in Proc. 19th Annual Symp. on Foundations of Computer Science, 48–54, Ann Arbor, MI, October 1978; IEEE Computer Society, Long Beach, CA, 1978.
M.E. Morrison, editor, Official Rules of Chess, 2nd ed., David McKay, New York, 1978.
S. Reisch, Gobang ist PSPACE-vollständig, Acta Inform. 13 (1980), 59–66.
S. Reisch, Hex ist PSPACE-vollständig, Acta Inform. 15 (1981), 167–191.
J.M. Robson, N by N chess is Pspace-hard, TR-CS-80-09, Computer Science Dept., Australian National University, 1980.
H. Samelson, editor, Queries, No. 4 (iii), Notices Amer. Math. Soc. 24 (1977), 190–191.
L.J. Stockmeyer and A.K. Chandra, Provably difficult combinatorial games, SIAM J. Comput. 8 (1979), 151–174.
J. Storer, A note on the complexity of chess, Proc. 1979 Conference on Information Sciences and Systems, Dept. of Electr. Eng., Johns Hopkins University, Baltimore, 160–166.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fraenkel, A.S., Lichtenstein, D. (1981). Computing a perfect strategy for n×n chess requires time exponential in n. In: Even, S., Kariv, O. (eds) Automata, Languages and Programming. ICALP 1981. Lecture Notes in Computer Science, vol 115. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10843-2_23
Download citation
DOI: https://doi.org/10.1007/3-540-10843-2_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10843-6
Online ISBN: 978-3-540-38745-9
eBook Packages: Springer Book Archive