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 Monte Carlo Tree Search algorithm we aim to optimize is SHUSS (Sequential Halving Using Scores). We automatically design the SHUSS root exploration term. For small search budgets of 32 evaluations the discovered root exploration term makes SHUSS competitive with usual PUCT (Predictor Upper Confidence bounds for Trees).