Artificial Intelligence - Iterative Deepening Depth limited Search Algorithm

preview_player
Показать описание
Artificial Intelligence - Iterative Deepening Depth limited Search Algorithm
Комментарии
Автор

nice explanation thanks for the lecture

CodeSeeker
Автор

I have one doubt here
I know by using both dfs and bfs : here memory efficiency is good
But we are just adding one more level
And redundantly we are applying dfs to visit same node again.
Can't we just check the next level?

AnandSharma-ltwq