80 likes | 230 Views
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. Board Detection. Apply Filter. 30X30. Max Points. Find Diagonal Closest.
E N D
Checkers Cheaters Moti Berger & EliranMoyal
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.
Board Detection Apply Filter 30X30 Max Points Find Diagonal Closest Compute Distance and Homography Find OuterPoints
HOUGH CIRCLES TRANSFORM With specific radius : 0.3*tile 0.4*tile With very low threshold in canny and center detection – find BLACK ON BLACK Circles Detection
UI Click anywhere to take picture Arrow(s) with best move will appear. Press green button to take another picture
Supports Kings Click 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 stateevaluation 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).