Problem solving as graph search
“Every problem is a graph search problem, as long as you can figure out the right graph to search”
- Graph vertices = states
- Graph arcs = action transitions
- Initial vertex and goal vertices identified
- Objective: find {any, cheapest, optimal} path from the initial state to any goal state
Note: this is taking us far afield from reactive/observable problems!