You might be interested by this article, for a very complete and tested answer. Plus the idea of grouping, but a good part of the effect seems to me to be giving a heuristic pre-value to moves, which might be done more efficiently otherwise:
eprints.pascal-network.org/archive/00004571/01/8057.pdf Jonas On Mon, 30 Mar 2009, Matthew Woodcraft 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/
