tree search.
a search algorithm based on random sampling of the search space.
- Selection: root and select successive child nodes until leaf is reached.
- The root is current game state and leaf is any node that has a potential child from no simulation
- Expansion: Unless ends the game decisively for either player, then create one (or more) child nodes and choose node from one of them.
- Simulation: Complete one random playout from node .
- Backpropgation: Result of playout to update information in nodes on path from to .