This paper proposes an efficient method to empirically design exploration terms for Monte Carlo Tree Search algorithms, such as PUCT and SHUSS, using Monte Carlo Search.