Chinook, the unbeatable checkers-playing computer

Scientists at the University of Alberta report that they've built an unbeatable checkers-playing computer. Their machine, Chinook, has solved checkers: It proves that if two players play perfectly, making no mistakes, the game of checkers will result in a draw.

The proof required analyzing 500 billion billion checkers positions -- 5 x 1020 -- a computational process that began in 1989 and has been running on hundreds of processors almost ... Full Story »

Posted by Kaizar Campwala
Tags Help
Subjects: Sci/Tech, Entertainment
Topics: Computers, Games
Editorial Help
Posted by: Posted by Kaizar Campwala - Jul 19, 2007 - 12:39 PM PDT
Edit Lock: This story can be edited

Reviews

Show All | Notes | Comments | Quotes | Links

Comments on this story Help (BETA)

NT Rating | My Rating

Ratings

3.6

not enough reviews
from 2 reviews (20% confidence)
Popularity
3.6
Recommendation
3.5
Credibility
4.0
# Reviews
1.0
# Views
5.0
# Likes
1.0
# Emails
1.0
More
How our ratings work »
(See these related stories.)

Links Help

No links yet. Please review this story to add some!