---
title: "Solving Checkers"
authors:
  - "Jonathan Schaeffer"
  - "Yngvi Björnsson"
  - "Neil Burch"
  - "Akihiro Kishimoto"
  - "Martin Müller"
  - "Robert Lake"
  - "Paul Lu"
  - "Steve Sutphen"
doi: ""
url: "https://ijcai.org/proceedings/2005/32"
pdf: "https://ijcai.org/proceedings/2005/0032.pdf"
venue: "Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence"
year: 2005
pages: "292-296"
track: ""
keywords:
---

# Solving Checkers

Jonathan Schaeffer, Yngvi Björnsson, Neil Burch, Akihiro Kishimoto, Martin Müller, Robert Lake, Paul Lu, Steve Sutphen

*Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence*, pages 292-296.

## Abstract

AI has had notable success in building highperformance game-playing programs to compete against the best human players. However, the availability of fast and plentiful machines with large memories and disks creates the possibility of 
  a game. This has been done before for simple or relatively small games. In this paper, we present new ideas and algorithms for solving the game of checkers. Checkers is a popular game of skill with a search space of     possible positions. This paper reports on our first result. One of the most challenging checkers openings has been solved – the White Doctor opening is a draw. Solving roughly 50 more openings will result in the game-theoretic value of checkers being determined.