Same as previously discussed iterative-deepening Keep fewer states in memory, but possibly visit them multiple times Cutoff is not depth, but f(n) Depending on how we increase the cut off, it can be very inefficient
Iterative Deepening Search