In past problems, all branching was defined by the actions (OR Nodes) In non-deterministic environments, we also have AND Nodes.
A solution will:
- have a goal node at every leaf
- specifies one action at each OR node
- includes every outcome branch at each AND node
- in implementations, we usually return failure to represent this.
- solutions can be [[Y3Q1/Reasoning and Problem Solving/Algorithms/BFS|BFS]], Greedy Best-First Search, or even A* Search
- And-Or Search algorithm
Alpha-Beta Pruning