Skip to content

Some Studies in Machine Learning Using the Game of Checkers

Arthur L. Samuel

IBM Journal of Research and Development · 1959 · 4,801 citations

No retraction on record in OpenAlex.Check Crossref now

Cite this paper

Samuel, A. L. (1959). Some studies in machine learning using the game of checkers. IBM Journal of Research and Development, 3(3), 210–229. https://doi.org/10.1147/rd.33.0210

In text: (Samuel, 1959)

Ask a question about this research

One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.

Abstract

Two machine-learning procedures have been investigated in some detail using the game of checkers. Enough work has been done to 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.

  1. DeepSeek-R1 incentivizes reasoning in LLMs through reinforcement learning2025
  2. Cognitive Load During Problem Solving: Effects on Learning1988
  3. A Formal Basis for the Heuristic Determination of Minimum Cost Paths1968
  4. Intelligent agents: theory and practice1995
  5. Structure-mapping: A theoretical framework for analogy1983

Metadata from OpenAlex (CC0). Citations are generated from the published record.