PROJECT TITLE :

Sequential Halving Applied to Trees

ABSTRACT:

Monte Carlo tree search (MCTS) is cutting-edge for multiple games and problems. The base algorithm currently used for MCTS is UCT. We have a tendency to propose an alternative MCTS algorithm: sequential halving applied to Trees (SHOT). It's multiple advantages over UCT: it spends less time in the tree, it uses less memory, it is parameter free, at equal time settings it beats UCT for a advanced combinatorial game and it will be efficiently parallelized.