3.4k citations · 9.9k across the 108 of their papers we have counts for
1 paper · 1 filter
Pierre-Arnaud Coquelin, Rémi Munos
Bandit based methods for tree search have recently gained popularity when applied to huge trees, e.g. in the game of go (Gelly et al., 2006). The UCT algorithm (Kocsis and Szepesva…