ocsis &amp; Szepesvári, 2006)</a>, each deriving from <a href="https://homes.di.unimi.it/cesa-bianchi/Pubblicazioni/ml-02.pdf">UCB (Auer, Cesa-Bianchi &amp; Fischer, 2002)</a> – stands for Predictor-Upper Confidence bound applied to Trees and is a calculation used at each node in the search tree to decide which move to examine. This choice is often framed as a <em>multi-armed bandit</em> problem, referencing a hypothetical problem wherein a gambler is trying to maximize profit from multiple slot machines