Available Indexes

Computing a perfect strategy for n x [i.e. superscript] n chess requires time exponential in n /
by Aviezri S. Frankel and David Lichtenstein.



Main Author: Fraenkel, Aviezri S.
Related Names: Lichtenstein, David 1953-
Language(s): English
Published: Urbana : Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1979.
Subjects: Game theory > Game theory / Data processing.
Computational complexity
Combinatorial analysis > Combinatorial analysis / Data processing.
Chess > Chess / Data processing.
Note: "UILU-ENG 79 1716."
Physical Description: 14 p. : ill. ; 28 cm.
Locate a Print Version: Find in a library


Item Link Original Source
Full view Report (University of Illinois at Urbana-Champaign. Dept. of Computer Science) no. 968 University of Illinois at Urbana-Champaign
View HathiTrust MARC record