Abstract
We have said that a game-playing algorithm often inspects the same thing many times over. A human, having studied a situation once, will in the future draw conclusions by the use of analogy. But, it often happens that seemingly insignificant changes in the position alter the course of the game and lead to substantially different outcomes. Such changes are said to be essential with respect to the contemplated variations. A human decides, well or poorly, whether a position that has been studied differs essentially from one that has not, and accordingly does or does not investigate variations starting from the latter. If we are to devise algorithms that use this method, we must analyze a) the notion of analogous moves (later we shall often use the term ‘the same’ rather than ‘analogous’) and b) the notion of the difference between positions essential for given variations.
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Adelson-Velsky, G.M., Arlazarov, V.L., Donskoy, M.V. (1988). The Method of Analogy. In: Algorithms for Games. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-3796-9_3
Download citation
DOI: https://doi.org/10.1007/978-1-4612-3796-9_3
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-8355-3
Online ISBN: 978-1-4612-3796-9
eBook Packages: Springer Book Archive