> So to sum up we have the following pseudo code : > at a given node : > > - find the child (among the visited child only) that maximizes de UCT-RAVE > value > > - if this maximum UCT-RAVE value is less than FPU value and if there still > exisits unvisited nodes : > > choose one unvisited node > > - continue > > > Is this correct ?
I don't think so. You simply substitute the FPU in the UCT-RAVE formula for the UCT score if you have not explored this move before. You can not encounter the case where there is no RAVE score because of priors, so there is never a problem filling that part of the formula in. So, you simply put FPU instead of the UCT score if you don't have an UCT score. -- GCP _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
