An intelligent search algorithm that combines elements of random sampling, simulation, and tree exploration to efficiently explore a large decision space.
MCTS is commonly used in games like Go, chess, and poker, as well as other complex domains where traditional search methods may be too slow or computationally expensive. For example, a computer program using MCTS was able to defeat a world champion Go player in 2016.