2009/6/23 Olivier Teytaud <teyt...@lri.fr>: > By the way, the conditions for consistency in Astar, which is quite related > to Monte-Carlo Tree Search in my humble opinion, imply optimism in the sense > that the value must be overestimated. UCT/MCTS is really similar to Astar > without so-called "close set".
Can you elaborate in the similarities between MCTS and A*? I am familiar with both algorithms, but I don't see any similarities whatsoever. _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
