Incremental Graph Search: Nondeterministic Version
This is an abstract way to look at the search problem. It highlights where the crucial choice is, and thus where we want to apply “intelligence”
- Set N ? initial state
- Loop
- if N is a goal node, terminate with success
- choose an action A to apply in N
- if there are no such actions, fail
- set N ? A(N)