Researchers Solve Checkers, Once And For All (broadcast Friday, July 20th, 2007)

Array.alttext

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. Teachers, find more information about using Science Friday as a classroom resource in the Kids' Connection.

Guests

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

Related Links

Segment produced by:Flora Lichtman

Listen:

Tools:

  • ADD TO DEL.ICIO.US
  • ADD TO DIGG
  • ADD TO NEWSVINE
  • ADD TO GOOGLE
  • ADD TO NETSCAPE
  • ADD TO WINDOWS LIVE
  • ADD TO REDDIT
  • ADD TO STUMBLEUPON
  • ADD TO TECHNORATI FAVORITES

Search the Site



Support for Science Friday provided in part by the Noyce Foundation and The Alfred P. Sloan Foundation