> No. We use a threshold that is a function of how large the tree > already is. It starts at 5 and then we increase it as the tree grows > larger. I think the exact formula scaled with something like the > log(tree_size)^2, but I would have to check when I get home. > > Álvaro.
Ah, now I understand. I'm not sure if I like the idea because the tree is very much shaped based on the initial estimated values. Do you think it is not a problem that the tree might struggle to converge to the best move once it has explored a long line that doesn't work? Greetings, Isaac -- Nur bis 31.05.: GMX FreeDSL Komplettanschluss mit DSL 6.000 Flatrate und Telefonanschluss nur 17,95 Euro/mtl.!* http://portal.gmx.net/de/go/dsl02 _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
