On Fri, 2008-03-28 at 11:20 +0100, Jaonary Rabarisoa wrote: > - its rave and uct value are defined ( in this case we can > compute the above score) > - only the rave value is defined (in this situation the n(s,a) > = 0 and the uct value is not defined) > - neiher rave nor uct value is defined > > So my question is how they handle these case when they traverse the > tree ? Because their score are not always defined for every childs of > a node.
I handled this by using FPU values. FPU = first play urgency, the value to initially assign to unvisited nodes. Other Gelley papers recommended a value of 1.1 > _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
