On Feb 6, 2008 11:39 AM, Gian-Carlo Pascutto <[EMAIL PROTECTED]> wrote:
> Hideki Kato wrote: > > > 4) Before back-propagating the value of each playout, I setup a color > > table for all intersections of the board for speed-up, in fact > > (initialized with EMPTY). That is, fill the board (table[move] = > > color) by tracing the moves and the colors returned by the playout > > forward (from leaf node to end of the game). Then, by tracing the > > path from root to the leaf node, clear the table[move] (table[move] = > > EMPTY), in order to avoid duplicate counting with UCB1. > > I don't understand this. What and how would you be double counting? Let's a set of stones played in the playout get captured and then the void gets filled again. The key is to count only the first move at a set board position. If you don't, you can end up counting a particular move more than once.
_______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
