Friday, July 20th, 2007

Researchers Solve Checkers, Once And For All

Checkers game, Visalia, California, 1941. Photo by Robert Hemmig. Library of Congress image.

If you're not camping out to grab the new Harry Potter book, how about a nice game of checkers? Researchers report in the journal Science this week that after sorting through 500 billion billion possible moves, they've been able to create a computer program that will never lose a game of checkers -- though if both players play perfectly, the game will end in a draw. What does it mean to have solved the game of checkers -- and does that achievement have any bearing on other games, like chess or poker? We'll talk with one of the scientists on the checker-playing team.

Guests

Jonathan Schaeffer
Professor of Computer Science
University of Alberta
Alberta, Canada

Related Links

• U of A GAMES Group Home Page
• Checkers computer becomes invincible - MSNBC.com
• Chinook
• U of A Computer Poker Research Group

Segment produced by:Flora Lichtman

Friday, July 20th, 2007

• Scientists Scour Genome For Clues About Disease
• Researchers Solve Checkers, Once And For All
• Why It's Hard To Admit To Being Wrong
• How To Pick The Perfect Peach

Elsewhere on Sciencefriday.com

Explore More

• Math
• Computers