I have to agree with Steve. Very often articles like this are not very accurate or scientific.
But I do know that checkers programs hit their endgame databases in the openings and that Chinook is "very close" to perfect play. They have probably constructed an opening book by trial and error that does not get them into losing positions. They have huge end game databases and now they are probably building huge opening databases that only include non-lost positions. In order to play a perfect game they need only to store 1 response for the computer, although they need all the responses for the opponent. However this still severely limits the number of positions the computer has to have perfect scores for. Because of their massive end game databases, they probably don't have to go but a few ply into the game with the opening book in order to get to a position they can solve brute force style. - Don On Thu, 2007-07-19 at 13:07 -0700, steve uurtamo wrote: > my guess is that you are in fact missing something -- > it seems unlikely that they enumerated _on disk_ all > possible games and their correct response moves. > > anything taking up less space than that would require > something more intelligent (or at least with a better > capacity to collapse situations) than brute force. > > please someone set me straight -- if it's simply a list, > generated one at a time, of board positions and response moves, > i'll have a merry laugh tonight. > > s. > > ----- Original Message ---- > From: David Doshay <[EMAIL PROTECTED]> > To: computer-go <computer-go@computer-go.org> > Sent: Thursday, July 19, 2007 3:53:01 PM > Subject: Re: [computer-go] Draughts / Checkers solved > > apparently you are not missing anything. > > Cheers, > David > > > > On 19, Jul 2007, at 12:50 PM, Nick Apperson wrote: > > > This is an exercise in proving that computers have more memory and > > processing power than before I feel. To solve a game, very little > > programming skill is necessary. The strategy for using processing > > power can only be one of a limited set of possible strategies. A > > game that is not solvable by brute force leaves room for so called > > AI which I don't think was present at all in this program what what > > it sounds like... Or am I missing something? > > > > On 7/19/07, Tom Cooper <[EMAIL PROTECTED]> wrote: http:// > > news.bbc.co.uk/1/hi/sci/tech/6907018.stm > > > > _______________________________________________ > > computer-go mailing list > > computer-go@computer-go.org > > http://www.computer-go.org/mailman/listinfo/computer-go/ > > > > _______________________________________________ > > computer-go mailing list > > computer-go@computer-go.org > > http://www.computer-go.org/mailman/listinfo/computer-go/ > > _______________________________________________ > computer-go mailing list > computer-go@computer-go.org > http://www.computer-go.org/mailman/listinfo/computer-go/ > > > > > > > ____________________________________________________________________________________ > Pinpoint customers who are looking for what you sell. > http://searchmarketing.yahoo.com/ > _______________________________________________ > computer-go mailing list > computer-go@computer-go.org > http://www.computer-go.org/mailman/listinfo/computer-go/ _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
