Bandit Algorithms for Tree Search

no code implementations • 9 Aug 2014 • Pierre-Arnuad Coquelin, Remi Munos

Then, we introduce and analyze a Bandit Algorithm for Smooth Trees (BAST) which takes into account ac- tual smoothness of the rewards for perform- ing efficient "cuts" of sub-optimal branches with high confidence.

Efficient Exploration Game of Go