3 ms·
>To get over this hurdle, the developers’ core idea was for AlphaGo to play the policy network against itself, to get an estimate of how likely a given board po
by grumpopotamus 11y ago
>To get over this hurdle, the developers’ core idea was for AlphaGo to play the policy network against itself, to get an estimate of how likely a given board position was to be a winning one. That probability of a win provided a rough valuation of the position.
This part is confusing in my opinion. It makes it sounds like AlphaGo is not using Monte Carlo Tree Search, which is mentioned earlier. However, this is exactly what AlphaGo is doing, except with the policy network in place of previous methods for initializing move priors, and the value network in place of traditional methods for terminating and scoring simulations.
- gcp 11y agoIf I read their papers right, they don't actually use the SL policy network, because it played worse when combined with MCTS than the RL one, even if it was stronger without tree search. (But you need the tree search to make a strong player)