Arthur Samuel's 1959 Checkers Program & Machine Learning

Samuel's IBM checkers program improved through rote and generalization learning, outplayed its author, and did not use the famous definition later credited to him.

A description of learning, not a slogan

Samuel's paper describes its subject as programming a computer "to behave in a way which, if done by human beings or animals, would be described as involving the process of learning." Its abstract is more concrete: testing verified a computer could be programmed to learn "a better game of checkers than can be played by the person who wrote the program," in 8 or 10 hours of machine-playing time.

The tidy one-liner now attached to his name, that machine learning gives computers "the ability to learn without being explicitly programmed," appears nowhere in this paper: not the abstract, the introduction, or the results.

Three years after the Dartmouth workshop had already named artificial intelligence, Samuel needed no borrowed slogan. His own line, a program that outplays its author, is blunter and easier to check than the phrase later writers put in his mouth.

Two ways the program got better

The program used two learning procedures. Rote learning saved every board position reached in play with the backed-up score a minimax search had assigned it; a recurring position deepened its next search by the levels already analyzed. A ply-based discount, shrinking a score slightly each level backed up, gave the program a sense of direction toward quicker wins, slower losses.

Generalization learning instead adjusted the coefficients of the scoring polynomial, a weighted sum of board features (piece advantage, denial of occupancy, mobility, center control, in the four-term version tested). After each move, the program compared its prior evaluation with the backed-up score once the move was made, and shifted each coefficient by whether its sign matched that difference.

Sutton and Barto later read this as an early, incomplete relative of temporal-difference learning: nudging a value estimate toward a later, better-informed estimate of the same position, without the explicit rewards a modern system would supply.

Lookahead, bounded by a clock

Move selection used a minimax procedure, working backward through a move tree to pick the move whose worst case scored best against a like-minded opponent. A ply was one proposed move plus one anticipated reply. The program searched a minimum of three plies, extended when a jump was available or had just occurred, and cut off at twenty plies once memory ran out; a move was budgeted about 30 seconds.

Better than its author, not the masters

By Samuel's own account, the rote-learning version "now qualifies as a rather better-than-average novice, but definitely not an expert."

Samuel's 1967 follow-up, after adding alpha-beta pruning and a longer parameter list, reported playing ability "greatly improved," the program still "unable to outplay checker masters."

That gap collapsed in retelling. A single 1962 win over a Connecticut player IBM billed as a top player, though his record never supported it, hardened into a claim the program had solved checkers, still repeated decades later.

Sources

  1. [1]
    Some Studies in Machine Learning Using the Game of Checkers

    IBM Journal of Research and Development · Jul 1959

  2. [2]
  3. [3]
    Reinforcement Learning: An Introduction, section 11.2: Samuel's Checkers Player

    Richard S. Sutton and Andrew G. Barto · retrieved Sep 9, 2026 · original offline, archived copy

  4. [4]
    Some Studies in Machine Learning Using the Game of Checkers. II—Recent Progress

    IBM Journal of Research and Development · retrieved Sep 9, 2026

  5. [5]
    Legacy - Chinook - World Man-Machine Checkers Champion

    University of Alberta, Department of Computing Science · Jul 17, 2007 · original offline, archived copy