6.034 Artificial Intelligence - Recitations, fall 2004 online slides on search
	Analysis Some redundant search, but small amount compared to work done on last iteration Dangerous if f values are very close to one another If threshold = 21.1 and next value is 21.2, probably only include 1 new node each iteration Time: $O(b^m)$ Space: $O(m)$ SMA* search can be used to remember some nodes from one iteration to the next.