I've always had this idea that the best way to build a book might also be the best way to build a game playing program. For instance we have done these big studies to determine based on games of Leela and others what the best main line of play is. Computer Chess programs analyze huge databases of games and make tree's sometimes to build opening books.
But it seems like this resembles to a remarkable degree a Monte Carlo Tree Search program. - Don On Sun, 2008-10-12 at 11:35 +0200, Denis fidaali wrote: > > Hi. I recall somehow that don ran some experiments with min-max(alpha-beta) > algorithms a while ago. > So i wonder if anyone had hard-data about some "min-ma"x equivalent > algorithms using "winrate", and "light-simulations". > I'd like to know what parameters were used back then, and as much of the > actual experiments results as possible > (Games against gnugo, scaling, games against amaf bot, cgos rating etc.. as > long as it concerns min-max&light-playout) > Thank you in advance. > > I have made a few tests with AMAF&min-max in the past few days, all giving > terrible results. My assumption is that my implementations where faulty. > So i have to design a path for getting it right somehow ... Any hard data > would help me a lot there in knowing how close i am to having it right. > _________________________________________________________________ > Téléphonez gratuitement à tous vos proches avec Windows Live Messenger ! > Téléchargez-le maintenant ! > http://www.windowslive.fr/messenger/1.asp_______________________________________________ > computer-go mailing list > [email protected] > http://www.computer-go.org/mailman/listinfo/computer-go/
signature.asc
Description: This is a digitally signed message part
_______________________________________________ computer-go mailing list [email protected] http://www.computer-go.org/mailman/listinfo/computer-go/
