Hi Mattew, I cannot answer for the current version of Mogo but I can for the one 1.5 years ago. Maybe it still holds. We had a transposition table as it was designed like that from the beginning. However the prior value of the node, was initialized when the node was created and indeed was depending of the previous move played in the current sequence. In practice, I think it does not change much.
Sylvain On Mon, Mar 30, 2009 at 11:36 PM, Matthew Woodcraft <[email protected]> wrote: > How are transpositions normally handled in monte-carlo tree search? > > I have been assuming that the natural thing would be to have a single > shared node for each board position, so that simulations which reach the > same position will use the same set of statistics (but when backing up > the result, to only update the nodes for the simulation actually > played). > > But I see in some of the Mogo papers that some of the contributions to > the heuristic value of a node depend on the position of the previous > move. > > So do MCTS programs not recognise transpositions at all? Or are the > heuristics from the time when the node was first created allowed to > stand, no matter what the simulation route is next time? > > -M- > _______________________________________________ > computer-go mailing list > [email protected] > http://www.computer-go.org/mailman/listinfo/computer-go/ > _______________________________________________ computer-go mailing list [email protected] http://www.computer-go.org/mailman/listinfo/computer-go/
