Besides, for each (s, p) pair, we store a cumulative reward Q(s, p) and a visit count N (s, p) during tree search for the subsequent reward function defined in Section 3.3.
each MCTS simulation contains four stages, as demonstrated in Figure 2 Selection.