iterative deepening search

Noun

 * 1)  A type of depth-first search in which each row of the tree is searched incrementally, simulating a breadth-first search with less memory usage.