4 ms·
It still uses MCTS as its search algorithm. It no longer uses random rollouts as part of the evaluation, though. (Previously it was rollouts/2 + value_network/2
by shmageggy 9y ago
It still uses MCTS as its search algorithm. It no longer uses random rollouts as part of the evaluation, though. (Previously it was rollouts/2 + value_network/2)
- espadrine 9y agoRandom rollouts are what the MC in MCTS stands for. Without that, it is simply a tree search. Excerpt from the paper: > [AlphaGo Zero] uses a simpler tree search that relies upon this single neural network to evaluate positions and sample moves, without performing any Monte-Carlo rollouts.
- xoroshiro 9y agoDoes this mean it learns what to search? I wonder why they thought it was a good idea. I thought the whole point of MC was that pruning algorithms like the ones in chess wouldn't work for a larger search space.
- shmageggy 9y agoThat's what the policy is. Given a board state, the policy gives you a distribution over all available moves.
- letlambda 9y agoThe policy network is a function from board states to a scoring of moves. The policy network with the greedy heuristic, ie pick the highest rated move with no explicit look ahead method, plays at a high amateur level. This was... unexpectedly good. It effectively reduces the branching factor of Go from the number of moves available, to the number of moves actually worth considering.