Action Selection Policies for Walking Monte Carlo Tree Search

Recent Reinforcement Learning methods have combined function approximation and Monte Carlo Tree Search and are able to learn by self-play up to a very high level in several games such as Go and Hex. One aspect in this combination<br/>that has not had a lot of attention is the action selection policy during self-play, which could influence the...