c99290c02/Minimizing-Simple-and-Cumulative-Regret-in-Monte-Carlo-Tree-Search.pdf">Pepels, Cazenave, Winands &amp; Lanctot (2014)</a> contend that accurate search relies on each player making the best response to their opponent's moves, and therefore, moves deeper in the tree should use the same algorithm as at the root, requiring a consistent application of any tiered approach. Their proposed method, H-MCTS, is such, relying on <a href="http://proceedings.mlr.press/v28/karnin13.pdf">sequential halving (Karn