game tree search method
C24840
concept
A game tree search method is an algorithmic approach that systematically explores possible moves and their consequences in a game’s decision tree to determine optimal or near-optimal actions.
Observed surface forms (3)
| Surface form | Occurrences |
|---|---|
| adversarial search algorithm | 1 |
| game tree search technique | 1 |
| heuristic search algorithm | 1 |
Instances (3)
| Instance | Via concept surface |
|---|---|
| Monte Carlo tree search | — |
| MCTS | heuristic search algorithm |
| alpha–beta pruning | game tree search technique |