Noun
iterative deepening search (countable and uncountable, plural iterative deepening searches)
(computer science, graph theory) 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.
Synonyms: iterative deepening depth-first search, (initialism) IDS, (initialism) IDDFS