Which Mogo paper(s)? Not all Mogo papers contain ideaa used by Mogo in
public releases / competitions. Some things are just research. I
remember hearing that the grandfather heuristic isn't good.
Sent from my iPhone
On Mar 30, 2009, at 5:36 PM, Matthew Woodcraft
<matt...@woodcraft.me.uk> 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
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
