Jonathan Schaeffer, a professor of computer science at the University of Alberta, set out on his checkers-playing quest in 1989, aiming to write software that could challenge the world checkers champion. But checkers - or draughts as it is known in Great Britain - is much more complex, with 500 billion billion theoretically possible board positions it is the most complex game that has been solved to date. In essence, that reduces checkers to the level of tic-tac-toe, where the ideal game-playing strategy has been codified into a series of immutable rules. An opponent, no matter how skilled, practiced or determined, can at best achieve a draw. Now, in an article published today on the Web site of the journal Science, the scientists report that they have rigorously proved that Chinook, in a slightly improved version, cannot ever lose. For an exercise in futility, go play checkers against a computer program named Chinook.ĭeveloped by computer scientists at the University of Alberta in Canada, Chinook vanquished human competitors at tournaments more than a decade ago.
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |