3 August - 9 August
Section outline
-
-
- Search (States & nodes)
- Strategies are evaluated along the following dimensions:
- completeness: does it always find a solution if one exists?
- time complexity: number of nodes generated
- space complexity: maximum number of nodes in memory
- optimality: does it always find a least-cost solution?
-
Solving problems by searching:
- Depth First Search
- Depth-limited search
- Iterative deepening search
-
Solving problems by searching:
- -Breadth-First Search
- -Uniform Cost Search
- -Bidirectional search