Monte Carlo tree search (MCTS) is a heuristic search algorithm for a sequence decision process. It has achieved great success in other areas, including defeating the 18-time world champion Lee Sedol in the game of Go [1]}, [2]}. Generally, there are four stages in a single iteration of MCTS (see Fig. REF ) [3]}:
<FIGURE>