Oops. Hideki Kato: <[EMAIL PROTECTED]>: >Zach Wegner: <[EMAIL PROTECTED]>: >>Interesting. Could you (or someone else) explain how DFUCT works? I'd >>imagine it doesn't save all the nodes in memory, but that seems rather >>counterintuitive. > >As far as I understand, > >The basic idea is that DFUCT continues searching avoiding going back >to root node if possible. To do this, DFUCT saves the number of wins, >the number of visits and the sum of number of visits of the brothers >of two nodes at root those ucb values are the maximum (first) and next "two nodes" should be "two arcs (moves)".
>to the maximum (second), in a stack. >The authors claimed in the paper that although DFUCT does not behave >the same as UCT when the third node at root comes up to the second, "third node" should be "third arc". >it's so rare that can be ignored. Sorry for mistakes. Hideki -- [EMAIL PROTECTED] (Kato) _______________________________________________ computer-go mailing list [email protected] http://www.computer-go.org/mailman/listinfo/computer-go/
