Computer Scientists Say Checkers Program is Unbeatable

Amid all the tech news breaking around the world, computer scientists from the University of Alberta are starting to steal the spotlight after proving they developed a computer program that can never lose in the game of checkers. Digital Journal — The computer program is called Chinook, which translates loosely into "you don't stand a chance at winning." Winning tournaments against top human competitors for more than 10 years, Chinook is a computer-based game of checkers (or draughts as it is known in the U.K.) that computer scientists say has been rigorously proven to be unbeatable. In a report published by the journal Science in their online edition, scientists said no matter how skilled the opponent, the best outcome possible is a draw. Beginning in 1989, professor Jonathan Schaeffer made it his goal to create software that could challenge and beat any world checkers champion. It took 18 years to complete. Solving and creating a program to beat anyone in checkers is no small feat; there are more than 500 billion theoretically possible board positions. Reports say even the most advanced computers would not be able to practically analyze all half-a-trillion positions, so researchers instead looked at typical starting positions and developed the program based on the resulting positions that occur during normal play. Schaeffer admits it's computational proof and not formal mathematical proof, but Chinook is being called a feat for programming, making checkers the most complex game solved to date. Schaeffer is said to be setting his sights on solving poker as his next trick. You can have your chance at beating Chinook by playing online at the university's website (be prepared to wait, as Chinook has a limit of 24 games at a time and the site is being bombarded today).