Solving problems by Searching

A goal-based Agent, the Problem-solving Agent.
Search algorithms: uninformed and informed.

Asymptotic complexity (theta() notation) and NP completeness. Classes P, NP, co-NP and #P.

A problem-solving agent:
1. Formulate: problem formulation
2. Search: input = problem, returns solution = actions sequence
3. Execute: actions carry out