Arthur Samuel . A brief biography that can be accessed from our page of tributes. By Victor Huang and Sung Ha Huh. Try to beat the checkers program, if you can, and then read the details about its programming. From Peter Ingebretson.
Strategy is reasonably simple, but the game is difficult to win against a talented opponent.
The AI playing this game uses a simple minimax algorithm, with alpha-beta pruning to reduce the size of the search tree. As such, it is quite challenging when searching moves deeper than five or six turns in advance. In Encyclopedia of Artificial Intelligence, Vol. Shapiro, Stuart C., 88-93. Griffith, K. A. 1974.