(graph theory) An algorithm for traversing a tree or graph where one starts at the root and explores as far as possible along each branch before backtracking.

In computer science, iterative deepening search or more specifically iterative deepening depth-first search (IDS or IDDFS) is a state space/graph search strategy in which a depth-limited version of depth-first search is run repeatedly with increasing depth limits until the goal is found.