CS44 W00: Lecture 3

Topics:

1. Uninformed Search: DFS, DFID, data driven and goal driven, bi-directional search

Uninformed Search

1. depth first search
• running time O(b^d)
• space requirements O(b * d)
• may not find the minimum cost solution
2. depth first iterative deepening
• running time O(b^d)
• space requirements O(b^d)
• finds the minimum cost solution (shortest path to the goal)
• this algorithm is asymptotically optimal in time-space over all brute-force shortest path algorithms on a tree
3. data driven and goal driven search
4. bidirectional search

Switch to:

• CS44 W00 Home Page
• Lecture 4