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

197914 pages

Dept. of Computer Science, University of Illinois at Urbana-Champaign·1 editions

Bookshelves

0 readers

No users with this book on their shelves. Maybe you could be the first.

0 discussions

0 quotes

0 reviews

0 lists

No lists containing this book.

Computing a perfect strategy for n x n chess requires time exponential in n | lit.salon