For an exercise in futility, play checkers against a computer program named Chinook. Developed by computer scientists at the University of Alberta in Canada, Chinook vanquished human competitors at ...

Checkers has 500 billion billion theoretically possible board positions. It is the most complex game that has been solved to date. Anyone can play a game against the ...

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, ...

A computer program named Chinook vanquished its human competitors at tournaments more than a decade ago. But now, in an article published Thursday on the Web site of the journal Science, the ...

Marion Tinsley, The Encyclopedia of Checkers describes him this way: "Marion Tinsley is to checkers what Leonardo da Vinci was to science, what Michelangelo was to art and what Beethoven was to music.

You wouldn’t think checkers could get so complicated. After working for six years with a network of up to 200 computers, Jonathan Schaeffer says he has developed a program that can never lose at ...