The article confuses me. How can checkers be "solved" if only the best-play outcome is only known for pieces involving at most ten pieces? On the other hand, the article says this: * * * It does not matter how the players make it to 10 checkers left because from that point on, the computer cannot lose, Schaeffer said. For two players who never make a mistake, every game would be a draw, he said. * * * This would seem to imply that the best-play outcome of the checkers start position is known to be a draw. Is that right? On 7/19/07, Mike Stay <metaweta@gmail.com> wrote:
Whew! It's just checkers, not chess.
On 7/19/07, Robert Baillie <rjbaillie@frii.com> wrote:
"Computer program can't lose at checkers"
http://news.yahoo.com/s/ap/20070719/ap_on_hi_te/solving_checkers;_ylt=AoQVuW...
apparently, they analyzed all games with 10 or fewer remaining pieces.
the correct website (not the one in the yahoo article) is: http://www.cs.ualberta.ca/~chinook/ warning: if you don't have the latest java, parts of the chinook site will hang your firefox browser!
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com http://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun
-- Mike Stay metaweta@gmail.com http://math.ucr.edu/~mike
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com http://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun
-- Thane Plambeck tplambeck@gmail.com http://www.plambeck.org/ehome.htm