Undefeatable Checkers Program

It's been only years after a combination of powerful hardware and software allowed Deep Blue to defeat World Chess Champion Garry Kasparov, and now researchers have announced the completion of an ‘unbeatable’ checkers program.
“After 18-and-a-half years and sifting through 500 billion billion (a five followed by 20 zeroes) checkers positions, Dr. Jonathan Schaeffer and colleagues have built a checkers-playing computer program that cannot be beaten. Completed in late April this year, the program, Chinook, may be played to a draw but will never be defeated.”
If two of these computers played each other an infinite amount of times, would they always end up in a draw?  Seems that way.

Tags:  RAM, ROG, table, Tab, pro, EA, AM, K