![Computing a perfect strategy for n x [i.e. superscript] n chess requires time exponential in n](/_next/image?url=https%3A%2F%2Fcovers.openlibrary.org%2Fb%2Fid%2F11853549-L.jpg&w=3840&q=75)
Computing a perfect strategy for n x [i.e. superscript] n chess requires time exponential in n
197914 pages
Dept. of Computer Science, University of Illinois at Urbana-Champaign·1 editions
Loading Description
Tags
NewBookshelves
0 readersNo users with this book on their shelves. Maybe you could be the first.
Threads
0 discussionsQuotes
0 quotesReviews
0 reviewsNo reviews yet. Add your review.
Lists
0 listsNo lists containing this book.