Computing a perfect strategy for n x [i.e. superscript] n chess requires time exponential in n

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



Download Options

Buy this book

Last edited by MARC Bot
August 29, 2021 | History

Computing a perfect strategy for n x [i.e. superscript] n chess requires time exponential in n

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

Buy this book

Previews available in: English

Book Details


Edition Notes

"UILU-ENG 79 1716."

Bibliography: p. 14.

Published in
Urbana
Series
Report (University of Illinois at Urbana-Champaign. Dept. of Computer Science) -- no. 968, Report (University of Illinois at Urbana-Champaign. Dept. of Computer Science) -- no. 968

The Physical Object

Pagination
14 p.
Number of pages
14

ID Numbers

Open Library
OL33148733M
Internet Archive
computingperfect968frae
OCLC/WorldCat
5234589

Source records

Internet Archive item 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
August 29, 2021 Created by MARC Bot import new book