Monte Carlo Tree Search (MCTS) is a heuristic search algorithm that builds a search tree by running randomized simulations, used to select strong actions in large decision spaces such as board games, without needing to exhaustively search all possibilities.