Advertisement

Computing a perfect strategy for n×n chess requires time exponential in n

Session 9: K. Mehlhorn, Chairman
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 115)

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

Decision Problem Polynomial Time Algorithm Exponential Time Board Game Board Position 
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.
Download to read the full conference paper text

References

  1. 1.
    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.Google Scholar
  2. 2.
    M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, San Francisco, 1979.Google Scholar
  3. 3.
    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.Google Scholar
  4. 4.
    M.E. Morrison, editor, Official Rules of Chess, 2nd ed., David McKay, New York, 1978.Google Scholar
  5. 5.
    S. Reisch, Gobang ist PSPACE-vollständig, Acta Inform. 13 (1980), 59–66.Google Scholar
  6. 6.
    S. Reisch, Hex ist PSPACE-vollständig, Acta Inform. 15 (1981), 167–191.Google Scholar
  7. 7.
    J.M. Robson, N by N chess is Pspace-hard, TR-CS-80-09, Computer Science Dept., Australian National University, 1980.Google Scholar
  8. 8.
    H. Samelson, editor, Queries, No. 4 (iii), Notices Amer. Math. Soc. 24 (1977), 190–191.Google Scholar
  9. 9.
    L.J. Stockmeyer and A.K. Chandra, Provably difficult combinatorial games, SIAM J. Comput. 8 (1979), 151–174.Google Scholar
  10. 10.
    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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  1. 1.Department of Applied MathematicsThe Weizmann Institute of ScienceRehovotIsrael
  2. 2.Department of Computer ScienceYale UniversityNew HavenU.S.A.

Personalised recommendations

Cite paper