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

  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read
Computing a perfect strategy for n x n chess ...
Aviezri S. Fraenkel
Not in Library

My Reading Lists:

Create a new list

Check-In

×Close
Add an optional check-in date. Check-in dates are used to track yearly reading goals.
Today

  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read

Buy this book

Last edited by MARC Bot
October 18, 2020 | History

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

  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read

This edition doesn't have a description yet. Can you add one?

Buy this book

Edition Availability
Cover of: Computing a perfect strategy for n x n chess requires time exponential in n
Computing a perfect strategy for n x n chess requires time exponential in n
1979, Dept. of Computer Science, University of Illinois at Urbana-Champaign
in English

Add another edition?

Book Details


Edition Notes

Bibliography: p. 14.

Published in
Urbana
Series
[Report] - Department of Computer Science, University of Illinois at Urbana-Champaign ; UIUCDCS-R-79-968

Classifications

Dewey Decimal Class
001.6/4/08 s, 519.3
Library of Congress
QA76 .I4 no. 968, QA269 .I4 no. 968

The Physical Object

Pagination
14 p., [6] leaves of plates :
Number of pages
14

ID Numbers

Open Library
OL4070445M
LCCN
79624414

Community Reviews (0)

Feedback?
No community reviews have been submitted for this work.

Lists

This work does not appear on any lists.

History

Download catalog record: RDF / JSON / OPDS | Wikipedia citation
October 18, 2020 Edited by MARC Bot import existing book
December 14, 2009 Edited by WorkBot link works
December 14, 2009 Edited by WorkBot link works
April 1, 2008 Created by an anonymous user Imported from Scriblio MARC record