DFSID
Posted: Tue Apr 13, 2004 11:58 am
Please, tell me what is DFSID algorithm. And what is difference between DFS and DFSID
I assume that in this case the ID means 'iterative deepening'.
Firstly, a 'depth bounded' dfs only searches to a particular depth. Iterative deepening involves successive calls to a depth bounded dfs with a larger bound each time. Like breath first search (and unlike ordinary dfs) it'll find the shallowest solution first. The advantage over bfd is that it does not require exponential memory. The downside is that it can take longer in the worst case.
Do any websearch for 'iterative deepening depth first search' and you'll find a wealth of information.