Abstract
Two machine-learning procedures have been investigated in some detail using the game of checkers. Enough work has been done by verify the fact that a computer can be programmed so that it will learn to play a better game of checkers than can be played by the person who wrote the program. Furthermore, it can learn to do this in a remarkably short period of time (8 or 10 hours of machine-playing time) when given only the rules of the game, a sense of direction, and a redundant and incomplete list of parameters which are thought to have something to do with the game, but whose correct signs and relative weights are unknown and unspecified. The principles of machine learning verified by these experiments are, of course, applicable to many other situations.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Samuel, A.L. (1988). Some Studies in Machine Learning Using the Game of Checkers. I. In: Levy, D.N.L. (eds) Computer Games I. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-8716-9_14
Download citation
DOI: https://doi.org/10.1007/978-1-4613-8716-9_14
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4613-8718-3
Online ISBN: 978-1-4613-8716-9
eBook Packages: Springer Book Archive