REGISTER  |  SIGN IN
Infinite Monkey Theorem Blog

Checkers is Mastered by Machine Location: BlogsIMT Blog    
By PatentMonkey on 7/20/2007 9:49 AM
The BBC reports that after thousands of computing hours, a computerized program has solved checkers to always achieve a win or tie against a competitor. While attempting to first understand winning human tactics through heuristic strategies, Professor Schaeffer was able to build a world champion winning program that still occasionally lost. By then moving to non-heuristic strategies and using pure computational force, the team then was able to model every possible scenario to achieve a win or tie.

The advance is considered the most complex game mastered to date.

Computers crack famous board game via [BBC News]
Permalink |  Trackback

Title:
Comment:
Add Comment   Cancel