Rebuttal-Fig.2: LA-MCTSonWalker2d

R1 Show the leftmost is the best leaf: By construction, the value of a left child (vl) > a right child (vr) and by17 recursively applying this rule on the tree, the leftmost nodeis expected to bethe highest value node.