Breadth-First Search Example

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