Abstract
Chess is not only one of the most engaging but also one of the most sophisticated of human activities. The game is so old that we cannot say when or where it was invented; millions of games have been played and thousands of books have been written about it; yet the play is still fresh and forever new. Simple arithmetic tells why. On the average, each move in chess offers a choice of about 30 possibilities, and the average length of a full game is about 40 moves. By this reckoning there are at least 10120 possible games. To get some idea of what that number means, let us suppose that we had a superfast computing machine which could play a million games a second (a ridiculous supposition). It would take the machine about 10108 years to play all the possible games!
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Editor information
Rights and permissions
Copyright information
© 1988 David Levy
About this chapter
Cite this chapter
Bernstein, A., de V. Roberts, M. (1988). Computer v Chess-Player. In: Levy, D. (eds) Computer Chess Compendium. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-1968-0_5
Download citation
DOI: https://doi.org/10.1007/978-1-4757-1968-0_5
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4757-1970-3
Online ISBN: 978-1-4757-1968-0
eBook Packages: Springer Book Archive