Kocsis and Szepesvári recommend to choose in each node of the game tree the move for which the expression w i n i + c ln ⁡ N i n i {\displaystyle {\frac {w_{i}}{n_{i}}}+c{\sqrt {\frac {\ln N_{i}}{n_{i}}}}} has the highest value.
科奇什和塞派什瓦里建议选择游戏树中的每个结点移动，从而使表达式 w i n i + c ln ⁡ t n i {\displaystyle {\frac {w_{i}}{n_{i}}}+c{\sqrt {\frac {\ln t}{n_{i}}}}} 具有最大值。