Computing a perfect strategy for n x [i.e. superscript] n chess requires time exponential in n
By: by Aviezri S. Frankel and David Lichtenstein
Contributors: Lichtenstein, David, 1953-
Series: Report (University of Illinois at Urbana-Champaign. Dept. of Computer Science) -- no. 968; Report (University of Illinois at Urbana-Champaign. Dept. of Computer Science) -- no. 968
Publisher: Dept. of Computer Science, University of Illinois at Urbana-Champaign
Published: 1979
Place of publication: Urbana
Language: eng
Number of pages: 14
Subjects: Chess; Data processing; Combinatorial analysis; Computational complexity; Game theory
Notes: "UILU-ENG 79 1716."

Bibliography: p. 14.