ead of the neural network is for. However, AlphaZero uses a metric different to Rosin's for this bound, so I will call theirs <em>AZ-PUCT</em> and use this term interchangeably for both the metric calculation and overall search algorithm, rather than the confusing <em>MCTS</em>.</p>
        <p>One discrepancy you may notice in treating tree search for chess as a hierarchical multi-armed bandit problem is that the gambler is concerned with overall profit: the sum of all winnings, even from low-paying machine