An edition of Computing a perfect strategy for n x n chess requires time exponential in n (1979)

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

by

Computing a perfect strategy for n x n chess ...
Aviezri S. Fraenkel, Aviezri S ...
Locate

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
Notes
Notes

Buy this book

Last edited by Open Library Bot
December 5, 2010 | History
Edit
An edition of Computing a perfect strategy for n x n chess requires time exponential in n (1979)

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

by

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

Publish Date
Publisher
Dept. of Computer Science, University of Illinois at Urbana-Champaign
Language
English
Pages
14

Buy this book

Subjects

Combinatorial analysis, Computational complexity, Computer chess, Data processing, Game theory
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

Source records

Library of Congress MARC record

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
December 5, 2010 Edited by Open Library Bot Added subjects from MARC records.
December 10, 2009 Created by WorkBot add works page