Computing a perfect strategy for n x n chess requires time exponential in n
By: by Aviezri S. Fraenkel and David Lichtenstein.
Contributors: Lichtenstein, David, 1953- joint author.
Series: [Report] - Department of Computer Science, University of Illinois at Urbana-Champaign ; UIUCDCS-R-79-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: Game theory -- Data processing.; Computer chess.; Combinatorial analysis -- Data processing.; Computational complexity.
Notes: Bibliography: p. 14.