Computing a perfect strategy for n x n chess requires time exponential in n
by Aviezri S. Fraenkel
Part of [Report] - Department of Computer Science, University of Illinois at Urbana-Champaign ; UIUCDCS-R-79-968
No club is reading this yet — be the first to start one
Discuss Computing a perfect strategy for n x n chess requires time exponential in n with other readers
Join or start a book club for Computing a perfect strategy for n x n chess requires time exponential in n on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.
Frequently asked questions
How do I join a book club for Computing a perfect strategy for n x n chess requires time exponential in n?
Sign up free on Readfeed, then browse public clubs or start your own club with Computing a perfect strategy for n x n chess requires time exponential in n as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.
Can I discuss Computing a perfect strategy for n x n chess requires time exponential in n with other readers online?
Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Computing a perfect strategy for n x n chess requires time exponential in n with readers worldwide — whether your club is virtual, in-person, or hybrid.
Is Readfeed free?
Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.