Monte Carlo tree search
= Monte Carlo tree search
{wiki=Monte_Carlo_tree_search}
Monte Carlo Tree Search (MCTS) is a heuristic search algorithm used for decision-making processes, most commonly in game-playing AI. It combines the concepts of Monte Carlo simulation and tree-based search to determine the most promising moves in games with large or complex search spaces, such as Go, Chess, and various video games.