Lex

Browse

GenresShelvesPremiumBlog

Company

AboutJobsPartnersSell on LexAffiliates

Resources

DocsInvite FriendsFAQ

Legal

Terms of ServicePrivacy Policygeneral@lex-books.com(215) 703-8277

© 2026 LexBooks, Inc. All rights reserved.

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

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

Aviezri S. Fraenkel

Details

OL Work ID
OL24938019W

Subjects

ChessData processingCombinatorial analysisComputational complexityGame theory

Find this book

Open Library
Book data from Open Library. Cover images courtesy of Open Library.