Monte Carlo Tree Search
Look several moves ahead. Make one real move.
Last selected path
New node
Search process
Complete UCT tree
0 / 512 simulations
Ready
Decision after search
Root actions
Final move: largest visit count (N)