A game tree maps a sequential decision problem as states connected by possible moves. Each node represents a game or environment state; each branch represents a move. Monte Carlo Tree Search operates on this kind of tree. section 7.1
Route planning
Start at a depot, branch into North or South routes, then branch again by which customer to visit first. Each node records a location or decision and its cost. section 7.1
Figure 7.1 Tree data structure in vehicle route planning problem
View the branching route-planning tree. section 7.1


