Although it has been proved that the evaluation of moves in Monte Carlo tree search converges to minimax,[REF] the basic version of Monte Carlo tree search converges very slowly.
Moreover, Monte Carlo tree search can be interrupted at any time yielding the most promising move already found.