fa25-cs540 cs540
Lecture 19: Uninformed Search Lecture 19: Uninformed Search
Content locked
The catalog is public. Reading this content requires approved access.
Sign in to readLecture 19: Uninformed Search
Introduction
The Search Problem
Example: River Crossing Puzzle
Example: 8-Puzzle
Example: Water Jugs
Uninformed Search on Trees
Breadth-First Search (BFS)
Algorithm
BFS Example
Performance of BFS
Uniform-Cost Search (UCS)
UCS Example
Performance of UCS
Depth-First Search (DFS)
Algorithm
DFS Example
What’s in the Fringe for DFS?
Problems with DFS
Performance of DFS
Iterative Deepening Search (IDS)
Properties of IDS
Performance Summary
General State-Space Search Algorithm
Handling Non-Tree State Spaces
Practice Problems
Key Takeaways
Suggested Reading
Coming Up