In computer science, Monte Carlo tree search (MCTS) is a heuristic search algorithm for some kinds of decision processes, most notably those employed in software that plays board games. In that context MCTS is used to solve the game tree. MCTS was combined with neural networks in 2016[1] and has been used in multiple board games like Chess, Shogi,[2] Checkers, Backgammon, Contract Bridge, Go, Scra