6.034 Artificial Intelligence - Recitations, fall 2004 online slides on search
	Iterative Deepening Search DFS with cutoff bound queueing-fn is enqueue-at-front as before, but (expand state) ONLY returns children where depth(children) $\leq$ threshold This prevents DFS from going down infinite path However, we may not find a solution at this threshold! Try one threshold - if no solution, increase threshold and start again from root