CHASLOT, GUILLAUME M. J-B.; WINANDS, MARK H. M.; HERIK, … - In: New Mathematics and Natural Computation (NMNC) 04 (2008) 03, pp. 343-357
Monte-Carlo Tree Search (MCTS) is a new best-first search guided by the results of Monte-Carlo simulations. In this article, we introduce two progressive strategies for MCTS, called progressive bias and progressive unpruning. They enable the use of relatively time-expensive heuristic knowledge...