Depth-First Search Example

Nodes Expanded: S A D E G Solution found: S A G return GENERAL-SEARCH(problem, ENQUEUE-AT-FRONT) expanded node nodes list ---- ---------- { S } S { A B C } A { D E G B C} D { E G B C } E { G B C } G { B C } Solution path found is S A G <-- this G has cost 10 Number of nodes expanded (including goal node) = 5