Lecture 20: Informed Search

Content locked

The catalog is public. Reading this content requires approved access.

Review of Uninformed Search

Breadth-First Search (BFS)

Uniform Cost Search (UCS)

Depth-First Search (DFS)

Iterative Deepening DFS

Uninformed vs Informed Search

Uninformed Search

Informed Search

Approaches to Using Heuristics

Attempt 1: Best-First Greedy Search

Attempt 2: A Search

Attempt 3: A* Search

Origins of A*

Designing Admissible Heuristics

Relaxation Approach

Heuristic Dominance

A* Termination

A* Revisiting Expanded States

A* Full Algorithm

A* Analysis

Beyond A*: Memory-Efficient Alternatives

IDA* (Iterative Deepening A*)

Beam Search

Practice Problems

Key Takeaways