Approximate planning in spatial search
Fig 3
Decision-tree for a maze with four rooms (hidden tiles that are revealed together).
The tree abstracts away from specific moves like ‘up’ and ‘left’ and considers more general actions like which area to uncover next. The root of the decision-tree corresponds to the player’s starting location. The four nodes accessible from the root indicate the possible observations that can be made next, followed by the observations that can follow each of those, and so on.