Search Algorithms
BFS, DFS, A*, and heuristic search: finding solutions in large state spaces.
Many AI problems can be framed as searching for a path through a state space. This chapter covers uninformed search — BFS, DFS, iterative deepening — and informed search — greedy best-first and A* — with analysis of completeness, optimality, time, and space complexity for each.