6.034 Artificial Intelligence - Recitations, fall 2004 online slides on search
	Depth-First Search queueing-fn puts children at front of open list BFS uses FIFO queue, DFS uses LIFO stack Net effect is to follow leftmost path to the bottom, then incrementally backtrack - also expand deepest node first