Abstract
Is there any need for a machine to play chess well? Opinions differ. Grandmasters, for example, become irritated at the question and say that this is idle talk—even if there is a need, the answer is far in the future, perhaps 50 years. Some scholars say that there is little use in wasting effort on “teaching” a machine genuine mastery of chess—to make it a second-rank player is enough. The importance and necessity of giving the machine a “higher education” will be proved later; for the present, the reader should accept them as proven.
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.
Rights and permissions
Copyright information
© 1970 Springer-Verlag New York Inc
About this chapter
Cite this chapter
Botvinnik, M.M. (1970). The Algorithm as a Chess Player. In: Computers, Chess and Long-Range Planning. Heidelberg Science Library. Springer, New York, NY. https://doi.org/10.1007/978-1-4684-6245-6_2
Download citation
DOI: https://doi.org/10.1007/978-1-4684-6245-6_2
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-90012-4
Online ISBN: 978-1-4684-6245-6
eBook Packages: Springer Book Archive