On the Tactical and Strategic Behaviour of MTCS when Biasing Random Simulations
Fabien Teytaud, Julien Dehos · ICGA Journal · 2015
Over the last few years, many new algorithms have been proposed to solve combinatorial problems. In this field, Monte-Carlo Tree Search (MCTS) is a generic method which performs really well on several applications; for instance, it has been used with