Hi Aja,
On Sun, Jan 2, 2011 at 1:29 AM, Aja <[email protected]> wrote: > Hi Fuming, > > C*RAVE+(1-C)*UCT > > C is computed dynamically in search, but not set to a fixed value. Maybe > you mean UCT_C, > > UCT=UCT_mean+UCT_C*exploration_term > > What Petr and Olivier do, I think, is set UCT_C to 0, to disable the > exploration_term, not the weight of RAVE. > > Without the exploring term, the UCT is just mean win rate, so there's no point in calling it UCT or UCB. Basically, what people have been saying is that currently the tree search is based on combination of sequence dependent rate (average win rate) and sequence independent/almost independent (rave rate) instead of combination of exploitation (win rate) and exploration (UCB term). Is this understanding close? Fuming
_______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
