  Monte Carlo Tree Search and Monte Carlo Search have good results for many
combinatorial problems. In this paper we propose to use Monte Carlo Search to
design mathematical expressions that are used as exploration terms for Monte
Carlo Tree Search algorithms. The optimized Monte Carlo Tree Search algorithms
are PUCT and SHUSS. We automatically design the PUCT and the SHUSS root
exploration terms. For small search budgets of 32 evaluations the discovered
root exploration terms make both algorithms competitive with usual PUCT.
