New computer program never loses at checkers

Statistically, Checkers, not unlike Tic-Tac-Toe and double-dice, has definite and relatively limited combinatorial span.

That's why many Checkers games can easily be predicted by many steps ahead, as well as the outcome of many games, some five to ten steps from the opening shot. Tie is also a common result of players beyond some level.

That's why many Tic-Tac-Toe games end up in a tie, for players above some minimal skill.

Here's why you cannot beat the computer:

Unlike the common hype in people's mind, both Chess and Checkers, are mere calculation. That's why it was stated that Deep-Blue bitting Kasparov did not prove the computer was more skilled or smarter than Kasparov. All it did prove, was that Chess is a calculation. A vast, astronomical calculation, but a mere calculation at that.

People tend to attribute to these games, vision, imagination, inspiration, daring, and many other non-relevant traits, thinking these are required to win the game.

The sad and trivial truth is that mostly, loosing a game is due to shortsighted overlook, or errant calculation. Take two computers or programs to match repeatedly, and see the emerging mean result of an equal number of wins on both sides, in cases not being a tie.