Depth-first search Depth-first search Expand deepest unexpanded node Expand deepest unexpanded node ors at front sorat front E Depth-first search Depth-first search Expand deepest anded node sors at front sors at fron Depth-first search Depth-first search Expand deepest unexpanded node Expand deepest unexpanded nodeDepth-first search Expand deepest unexpanded node Implementation: fringe = LIFO queue, i.e., put successors at front A B C D E F G H I J K L M N O Chapter 3 49 Depth-first search Expand deepest unexpanded node Implementation: fringe = LIFO queue, i.e., put successors at front A B C D E F G H I J K L M N O Chapter 3 50 Depth-first search Expand deepest unexpanded node Implementation: fringe = LIFO queue, i.e., put successors at front A B C D E F G H I J K L M N O Chapter 3 51 Depth-first search Expand deepest unexpanded node Implementation: fringe = LIFO queue, i.e., put successors at front A B C D E F G H I J K L M N O Chapter 3 52 Depth-first search Expand deepest unexpanded node Implementation: fringe = LIFO queue, i.e., put successors at front A B C D E F G H I J K L M N O Chapter 3 53 Depth-first search Expand deepest unexpanded node Implementation: fringe = LIFO queue, i.e., put successors at front A B C D E F G H I J K L M N O Chapter 3 54