Depth-first search
	n Expand deepest unexpanded node n Implementation: n fringe = LIFO queue, i.e., put successors at front