14 Jan 2004
CS 3243 - Blind Search
39
Depth-first search
n
Expand deepest unexpanded node
n
Implementation
:
n
fringe
= LIFO queue, i.e., put successors at front
