The tree search was implemented as a simplification of the algorithm described by Segler et. al. The MCTS algorithm was simplified with regards to the policy (or filter) network. The same network was used for both the expansion and the roll-out. The prior probabilities were not used by default during the selection of leaf nodes for expansion, but the Q value was initialized at 0.5 and N at 1, as expansion counts as a first visit.