This is topic Checkers: Solved. in forum Books, Films, Food and Culture at Hatrack River Forum.


To visit this topic, use this URL:
http://www.hatrack.com/ubb/main/ultimatebb.php?ubb=get_topic;f=2;t=049384

Posted by Juxtapose (Member # 8837) on :
 
Computerized checkers player can't be beaten

quote:
CHICAGO — With uniform pieces and diagonal moves, checkers is simple enough for a child to learn. But to achieve absolute mastery of the game, scientists needed to run hundreds of computers for nearly 20 years, analyzing roughly 500 billion billion scenarios.

By completing the project, a team of Canadian researchers have officially "solved" checkers, creating an unbeatable program that will choose the best move in every possible situation.

This achievement represents a major benchmark in the field of artificial intelligence, which uses games to develop complex problem-solving strategies for computers.
...


 
Posted by Flaming Toad on a Stick (Member # 9302) on :
 
First-Checkers.
Next-THE WORLD!!
 
Posted by FlyingCow (Member # 2150) on :
 
What would happen if the computer played itself?
 
Posted by rollainm (Member # 8318) on :
 
quote:
Originally posted by FlyingCow:
What would happen if the computer played itself?

quote:
The resulting program proves that checkers is a "draw" game; in other words, perfect play by both players will always result in a draw.

 
Posted by rollainm (Member # 8318) on :
 
quote:
The entire solution includes 500,995,484,682,338,672,639 possible board configurations, according to the study, which was funded by the Canadian and Alberta governments.
Wow...just wow...
 
Posted by dantesparadigm (Member # 8756) on :
 
So that's what they're up to in Canada. I suppose now that that's all settled they'll turn to conquering the world now.
 
Posted by Nighthawk (Member # 4176) on :
 
quote:
The resulting program proves that checkers is a "draw" game; in other words, perfect play by both players will always result in a draw.
That can be said about any game, can't it?

quote:
The entire solution includes 500,995,484,682,338,672,639 possible board configurations, according to the study, which was funded by the Canadian and Alberta governments.
So what they're basically hinting at is that, for each possible board combination, they have a predetermined move? It implies theoretically infinite depth analysis, all the way to the game conclusion; that can't be adequately done in real time.


"How about a nice game of chess?"
 
Posted by Tante Shvester (Member # 8202) on :
 
quote:
Originally posted by FlyingCow:
What would happen if the computer played itself?

::insert onanism joke here::
 
Posted by mr_porteiro_head (Member # 4644) on :
 
quote:
Originally posted by Nighthawk:
quote:
The resulting program proves that checkers is a "draw" game; in other words, perfect play by both players will always result in a draw.
That can be said about any game, can't it?


It can be said, but it cannot be proven for all games like it now has been for checkers.
 
Posted by fugu13 (Member # 2859) on :
 
NH: no, it can't. There are some games that lead to a definite winner, given perfect play by both.

And you're right, it can't be done in real time. That's why they precomputed all moves necessary to determine the correct move at any point in time. Given they managed to reduce the problem space so much, I assume they have an algorithm to force uncomputed sequences to converge to the solved space (and proven to work at doing so).

Apparently professional checkers matches start with three random moves, and they claim to have solved many of the previously unconsidered cases generated by those as well (and be well on the way to solving the rest).
 
Posted by MEC (Member # 2968) on :
 
At least they haven't solved tic-tac-toe yet, right?


...right?
 
Posted by orlox (Member # 2392) on :
 
9 minute realaudio file with the programmer from Science Friday:
http://www.npr.org/dmg/dmg.php?prgCode=TOTN&showDate=20-Jul-2007&segNum=2&mediaPref=RM
 
Posted by anti_maven (Member # 9789) on :
 
Hello Professor Falken.

Would you like to play a game?
 
Posted by MightyCow (Member # 9253) on :
 
At least we don't have to worry about the Matrix until computers can win at Go. If checkers and chess is the best the computers can do, it wouldn't be a very realistic dystopia.
 
Posted by King of Men (Member # 6684) on :
 
quote:
Originally posted by Nighthawk:
quote:
The resulting program proves that checkers is a "draw" game; in other words, perfect play by both players will always result in a draw.
That can be said about any game, can't it?
No. There are many games that can be shown to be a win for one player or the other. Nim, for example.
 
Posted by Nighthawk (Member # 4176) on :
 
Now the computers want to take our Texas Hold 'em, too!

http://wcbstv.com/watercooler/local_story_202200457.html
 


Copyright © 2008 Hatrack River Enterprises Inc. All rights reserved.
Reproduction in whole or in part without permission is prohibited.


Powered by Infopop Corporation
UBB.classic™ 6.7.2