Introduction
Chapter 3 and 4 represented problem solving as search through a set of problem situations or states. This state space approach to problem solving allows graph theory to be used as a tool for designing and analyzing programs
Chapter 3 defined a general backtracking graph search algorithm as well as algorithms for both depth-first and breadth-first search
Chapter 4 presented algorithms for heuristic search