Sequential Halving Applied to Trees PROJECT TITLE :Sequential Halving Applied to TreesABSTRACT: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. Did you like this research project? To get this research project Guidelines, Training and Code... Click Here facebook twitter google+ linkedin stumble pinterest Robust global identification of linear parameter varying systems with generalised expectation–maximisation algorithm A Dynamically Optimized SSVEP Brain–Computer Interface (BCI) Speller