An edition of Computing a perfect strategy for n x [i.e. superscript] n chess requires time exponential in n
(1979)
Computing a perfect strategy for n x [i.e. superscript] n chess requires time exponential in n
by Aviezri S. Fraenkel
- 0 Ratings
- 0 Want to read
- 0 Currently reading
- 0 Have read
Share
×Close
![Cover of: Computing a perfect strategy for n x [i.e. superscript] n chess requires time exponential in n by Aviezri S. Fraenkel](http://covers.openlibrary.org/b/id/11853549-L.jpg)
This edition doesn't have a description yet. Can you add one?
Check nearby libraries
Buy this book
Previews available in: English
Showing 1 featured edition. View all 1 editions?
| Edition | Availability |
|---|---|
1
![Cover of: Computing a perfect strategy for n x [i.e. superscript] n chess requires time exponential in n](http://covers.openlibrary.org/b/id/11853549-S.jpg "Cover of: Computing a perfect strategy for n x [i.e. superscript] n chess requires time exponential in n")
Computing a perfect strategy for n x [i.e. superscript] n chess requires time exponential in n
1979, Dept. of Computer Science, University of Illinois at Urbana-Champaign
in English
|
aaaa
Libraries near you:
WorldCat
|
Book Details
Edition Notes
"UILU-ENG 79 1716."
Bibliography: p. 14.
The Physical Object
ID Numbers
Community Reviews (0)
Feedback?
| August 29, 2021 | Created by MARC Bot | import new book |