Three closely related problem classes:
- Search: Find the ``magic node'' in a graph.
- Planning: Find a sequence of actions to the goal.
- Constraint Satisfaction Problems: Find a satisfactory configuration.
These problems are extremely important & quite related.
Next: Deterministic Planning
Up: CONNECTIONS
Previous: CONNECTIONS