Reducing the game of checkers into a group of algorithms of movement, computer scientist Jonathan Schaeffer has developed a program called Chinook that he has proven that at the least will draw. Apparently checkers played in a perfect game will always end in a draw.
Forget hoity-toity chess programs, Chinook has long ago ditched any human competition. The work since then was only to find an unbeatable game, and a proof to the algorithm that is the game of checkers. On the Chinook website is a link to the proof for verification. (I started to, but then I realized how much non-fun I had in my discrete math and program verification course, and decided to put it off until never.)
You can also play against the program, in a more dumbed-down version that is difficult, but that won’t always win.
