Checkers Cheaters

Moti Berger &

Eliran Moyal

Goals

• Detection of the board and the pieces (blacks and whites).

• Display of an optimal move using animated arrows according to a non-trivial heuristic.

Apply Filter

( 1 −1−1 1 )

30X30

Max Points

Find Outer Points Find Diagonal Closest

Compute Distance and Homography

Board Detection

Circles DetectionHOUGH CIRCLES TRANSFORM

With specific radius : 0.3*tile 0.4*tileWith very low threshold in canny and center detection – find BLACK ON BLACK

UIClick anywhere to take pictureArrow(s) with best move will appear. Press green button to take another picture

Supports KingsClick On "Place kings" and then on kings,Message will appear.

Press Solve to get best move with king

MiniMax with

• Suggested move is achieved by MiniMax search algorithm with pruning for optimization.

• Board’s state evaluation process involves a weighted set of heuristics.

Algorithm’s limitations

• Taking a picture from a wide angle (having difficulty to detect circles).

• Taking a picture from one of the board’s corners (having difficulty to detect farthest points).