Hi, I'm also interested at the same thing.
> <snip> > > > > I tried putting this into pseudo code, but it already looks like C. ;p > > http://pastie.org/357231 > > If you could look at it, I would be most grateful. > > It sounds good but it seems to lack the check of whether a given move is > first played in a given intersection. When you add that, it because a little > more tricky to update in the tree. You also update the value of each move > independently of the color, i.e. a position in which it is black turn will > be update with white moves. You should restrict the update. I have a question about the the part were the stats are updated. (l.15-25). having an array of amaf-values in every node seems very memory intensive and I don't get how you would access these values. Something like searching for all nodes below the visited node with the same pos+color as the ones visited and updating amaf-stats directly in these nodes would make more sense to me. (but also costs more cpu time) Hope I don't bring in more confusion into the topic, but I really would like to get rave done right. > Hopes that helps, > Sylvain > > > > > > > > -Isaac > > thanks for you help wabu _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
