ionally propose a two-tiered approach to minimizing regret by considering simulation counts higher and lower in the search tree; for example, minimizing simple regret at the root and cumulative regret lower. Lc0 discusses a <a href="https://github.com/LeelaChessZero/lc0/discussions/1591">concrete proposal mirroring this approach</a>. However, <a href="https://www.researchgate.net/profile/Tom-Pepels/publication/263768554_Minimizing_Simple_and_Cumulative_Regret_in_Monte-Carlo_Tree_Search/links/53dcafe10cf2cfa