Le 25/11/2009 à 12:39, Vlad Dumitrescu a écrit : > > On Wed, Nov 25, 2009 at 12:04, Nick Wedd <n...@maproom.co.uk> wrote: > > A program to play Hahn Go has no > > reason to calculate probabilities, it should just make the biggest move it > > can. > > Ah, okay, now I understand your point of view. Thanks for explaining. > > Making the largest move available is just one possible strategy to > attain the goal of ending the game with the most points scored. A more > general strategy is to weigh the moves' size with the risks they can > backfire. This is taken onto account in the tree. If playing one move lead 10% of time to +10, and 90% to -20, the resulting value is -17 (of course with the bot evaluation/playout)
> Evaluating the risks is probably just as difficult (or maybe more > difficult) than evaluating a move's value (which is difficult enough), > but IMHO just being greedy is not helping one's game. Might it be for > this reason that MCTS doesn't show good results when trying to > maximize score? They don't try to maximise score, that's why they are not good at it :-) Best regards Alain _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
