This document discusses checkers and an AI approach to playing the game. It provides background on checkers, outlines how the game is played, and discusses checkers from an AI perspective in terms of states, operators, and heuristics used. The presentation includes sections on background, checkers rules, an AI view, heuristics strategies from beginner to intermediate levels, a demonstration of a sacrificial move strategy, and conclusions.

1. Under the Guidance of Assoc. Prof. Shahin Emrah
Presented by: Nicat Suleymanov

2. OUTLINE
 BACKGROUND
 CHECKERS GAME
 HOW TO PLAY
 AI – PERSPECTIVE
 DEMO
 CONCLUSION
 REFERENCES

3. BACKGROUND-COMPUTER GAMES
AND AI
 Game playing was one of the earliest
researched AI problems.
 It has been studied for a long time.
 Sole Motive is to get a game
solved, outcome of the game can be
determined even before the game is
started.

4. CHECKERS GAME
 One of the earliest form of checkers
at Ur in Iraq (around 3000 B.C)
 In Egypt Alquerque, a game which had a 5X5 board
(1400 B.C).
 In 1100 A.D., an innovative Frenchman thought of
playing the game on a chess board.

5. HOW TO PLAY- START POSITION
AND DIAGONAL MOVES

6. HOW TO PLAY- FORCED
CAPTURES BY JUMPING OVER
THE ENEMY’S POLL

7. HOW TO PLAY- KING CAN MOVE
MORE THAN ONE STEP.

8. HOW TO PLAY- IF MULTIPLE
CAPTURING IS POSSIBLE, IT IS
MANDATORY.

9. HOW TO PLAY- IF MULTIPLE
CAPTURING IS POSSIBLE, IT IS
MANDATORY.

10. HOW TO PLAY- IF MULTIPLE
CAPTURING IS POSSIBLE, IT IS
MANDATORY.

11. HOW TO PLAY- IF MULTIPLE
CAPTURING IS POSSIBLE, IT IS
MANDATORY

12. AI–PERSPECTIVE- COMPONENTS
OF THE GAME
 A finite set of states.
 The initial state.
 A set of operators.
 A terminal test.
 A payoff function.

13. AI–PERSPECTIVE- HOW TO WIN
CHECKERS
 Control the center.
 Checkers is not a game that can be won by
playing defensively.
 Your goal should be getting a checker to the end
of the board.
 Be willing to sacrifice a checker if necessary.
 Finally, remember the blocking option.

14. HEURISTICS
Beginner (Random)
Amateur (Defensive)
Intermediate(Tactical)

15. BEGINNER (RANDOM)
 Flazen makes a move randomly
without taking into consideration
the current board configuration
 But rules are kept in mind in each
step.

16. AMATEUR (DEFENSIVE)
 Generates all moves and discards
the moves which he can lose any
checker.
Static Evaluation Function
=
totalmoves - totallosing

17. INTERMEDIATE(TACTICAL)
 Based on debuts and
strategies which includes
giving sacrifice and getting
equal or more checkers
from opponent.

18. GIVING SACRIFICE SITUATION

19. GIVING SACRIFICE-PROGRESS

20. GIVING SACRIFICE-RESULT

21. DEMO

22. CONCLUSION
 Board Game – a wonderful application to use AI
 Study is done on the Russian Checker, using
different tactics.
 It is intended to add new strategies and
algorithms; especially positional algorithm
would be a good choice.

23. REFERENCES
 “Начала и Середина Игры В Шашки”
“Beginning and Middle of Game of Checkers” (in English)
author: Kuperman Kaplan (Kуперман Kаплан), V.M.
Kaplan (B.M. Kаплан)
 “Yapay Zeka Problemler- Yöntemler-Algoritma”
“Artificial Intelligence Problems-Methods-Algorithms” (in
English) author: Vasif Nabiyev
 “What Is The Origin Of Draughts?” by. Charles C. Walker
(from "Checkers Magazine“)