Checkers Is Solved

  title={Checkers Is Solved},
  author={Jonathan Schaeffer and Neil Burch and Yngvi Bj{\"o}rnsson and Akihiro Kishimoto and Martin M{\"u}ller and Robert Lake and Paul Lu and Steve Sutphen},
  pages={1518 - 1522}
The game of checkers has roughly 500 billion billion possible positions (5 × 1020). The task of solving the game, determining the final result in a game with no mistakes made by either player, is daunting. Since 1989, almost continuously, dozens of computers have been working on solving checkers, applying state-of-the-art artificial intelligence techniques to the proving process. This paper announces that checkers is now solved: Perfect play by both sides leads to a draw. This is the most… 

Computer Games

Results from a preliminary study on how to best use the data to improve the play of a Chinese Checkers program are reported.

Game-Tree Search Using Proof Numbers: The First Twenty Years

An overview of the research on Proof-Number Search and its many variants and enhancements is provided.

Gardner's Minichess Variant is Solved

Gardner's minichess variant in which all pieces are set as in a standard chessboard is considered, which has roughly 9x10^{18} legal positions and is comparable in this respect with checkers.

Solving Jungle Checkers

Using endgame databases constructed by retrograde analysis, this work tries to ultra-weakly solve Jungle Checkers by using the concept of a proof tree: both alpha-beta pruning and proof-number search algorithms are applied.

The dark side of the board: advances in chess Kriegspiel

This thesis presents, documents and tests a multi-sided effort towards making a strong Kriegspiel player, using heuristic searching, retrograde analysis and Monte Carlo tree search algorithms to achieve increasingly higher levels of play.

Combinatorial Games: From Theoretical Solving to AI Algorithms

In the current survey, the basics of the best AI programs will be presented, and in particular the well-known Minimax and Monte-Carlo Tree Search approaches.

Countdown Numbers Game: Solved, Analysed, Extended

The Countdown Numbers Game is solved in the sense that the optimal solution for the nearly 12 million puzzle instances has been generated and recorded using the HR3 Automated Theory Formation system.

A New Chess Variant for Gaming AI

A newly-invented chess variant called Switch-Side Chain-Chess, which states that players have the choice to switch sides with each other if a continuous link of pieces is created on the board, increases significantly the complexity of chess.

Reuse of Past Games for Move Generation in Computer Go

Results show that the CBR-based approach to the new computer Go playing system is a significant improvement over the initial prototype, and in the opening game it allows the program to quickly locate the most strategically interesting areas of the board.

Research and implementation of static evaluation algorithm for checkers

The composition of the computer game system and the rules of Checkers that is a complex two-player chess game is introduced and an evaluation function with value matrix of the pieces is proposed.



Programming a computer for playing chess

This paper is concerned with the problem of constructing a computing routine or “program” for a modern general purpose computer which will enable it to play chess. Although perhaps of no practical

An Analysis of Alpha-Beta Pruning

XXII. Programming a Computer for Playing Chess 1

(1950). XXII. Programming a computer for playing chess. The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science: Vol. 41, No. 314, pp. 256-275.

Solving awari with parallel retrograde analysis

A parallel search algorithm running on a large computer cluster solves a popular board game by computing the best moves from all reachable positions. The resulting databases contain scores for 889

Empirical Measurements of Disk Failure Rates and Error Rates

SATA uncorrectable read errors are not yet a dominant system-fault source - they happen, but are rare compared to other problems, and UER (uncorrectable error rate) is not the relevant metric for data architects needs.

Supporting online material Materials and methods

We use a 48-km square horizontal by 24-km vertical domain with uniform 500-m horizontal by 375-m vertical grid spacing. A dynamics model (S1) integrates the anelastic equations for deep convection

The retinex theory of color vision.

  • E. Land
  • Physics, Medicine
    Scientific American
  • 1977