April 2018
Intermediate to advanced
334 pages
10h 18m
English
The Monte Carlo Tree Search (MCTS) is a planning algorithm and a way of making optimal decisions in case of artificial narrow intelligence problems. MCTS works on a planning ahead kind of approach to solve the problem.
The MCTS algorithm gained importance after earlier algorithms such as minimax and game trees failed to show results with complex problems. So what makes the MCTS different and better than past decision making algorithms such as minimax?
Let's first discuss what minimax is.