Abstract
In 1956 a group at Los Alamos programmed maniac-I to play chess (Kister et al, 1957). The Los Alamos program is an almost perfect example of the type of system specified by Shannon. As shown in the Table, all alternatives were considered: all continuations were explored to a depth of two moves (i. e., two moves for Black and two for White): the static evaluation function consisted of a sum of material and mobility measures; the values were integrated by a minimax procedure,* and the best alternative in terms of the effective value was chosen for the move.
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
Newell, A., Shaw, C., Simon, H. (1988). Chess Playing Programs and the Problem of Complexity. In: Levy, D. (eds) Computer Chess Compendium. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-1968-0_4
Download citation
DOI: https://doi.org/10.1007/978-1-4757-1968-0_4
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