On Mon, Jun 1, 2009 at 10:10 AM, Isaac Deutsch <i...@gmx.ch> wrote: > >> 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?
Well, I'll take that over crashing with an out-of-memory error. :) _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
