Monte-Carlo Tree Search (MCTS) is a popular technique for playing multi-player games. In this paper, we propose a new method to bias the playout policy of MCTS. The idea is to prune the decisions which seem “bad” (according to the previous iterations of the algorithm) before computing each playout. Thus, the method evaluates the estimated “good” moves more precisely. We have tested our improvement for the game of Havannah and compared it to several classic improvements. Our method outperforms the classic version of MCTS (with the RAVE improvement) and the different playout policies of MCTS that we have experimented.
CITATION STYLE
Duguépéroux, J., Mazyad, A., Teytaud, F., & Dehos, J. (2016). Pruning playouts in monte-carlo tree search for the game of havannah. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10068 LNCS, pp. 47–57). Springer Verlag. https://doi.org/10.1007/978-3-319-50935-8_5
Mendeley helps you to discover research relevant for your work.