Iterative Deepening

How to get depth first search to return the shortest path to the goal state by using iterative deepening.

[jivey]

It's a rare gem to hear CS lectures in a understandable accent.

[bamboom]

Probably the best cs teacher i have seen deserves a subscribe

[patrickmayer]

*Modified DFS with a bound. You only continue going down the tree to nodes that take d or less steps to get to.

Thanks for the video!

[antonsavenkov]

It would be very good, if the videos were numbered. Especially if on video is referred to in another.
Thank you for excellent material.

[abhirustagi]

ThankYou Sir. Easy to understand explanation.

[ericklarac]

Nice video, you can also explain CSP (Constraint Satisfaction Problems)

[NinaHProductions]

Sorry but at 03:03 are you saying that we can't search B because our depth limit is a maximum of 2 but if it was a maximum of 3 - you would then search B. However you have already placed a dead end on it even before you find the goal state. This bit is slightly confusing but nice clear explanation

[RGQUTT]

3:20 you found the goal, but now the way you check all nodes seems the same like BFS for me. If you wouldve applied BFS you wouldve found the same solution, and did not even check all things twice or three times. My question is, how is this different from BFS and how can this be better than BFS

[SentryProductions]

Good videos, these have assisted me with understanding these algorithms. However, an example of Iterative Deepening with DFS with depth bound of k + 3 would have been good to see. Although Iterative Deepening is quick with DFS I think it repeats its work. For example, it repeats work of k when traversing to k+1 and it repeats work of k and k+1 when traversing to k+2 etc etc...

[BeSharpInCSharp]

Please sir put videos on bidirectional searches. Also point out the real world scenarios where each type of search is suitable.

[maryrooster]

Great explanation, but the camera's auto-focus seems to be on and the image keeps zooming in and out.

[que_]

A depth limit of value 3 or 4 would have been more insightful. And you forgot to mention on how the nodes are generated repeatedly. Like for depth limit 2, the root will be generated 3 times, and nodes at level 1 will be generated two times and likewise​.

[berilakar]

Thank you sir (I wanted to mention that you are very similar to the actor in lost called Benjamin) Love you sir <^3

[motorheadbanger]

When you increase the depth limit, do you start from the start state again and do all those expansions again?

[sabrinakhn]

Hi, is this the same as iterative deepening A* search?

[enjalparajuli]

What are the explored states? It is SA?

[ze]

When will more videos be uploaded, please thanks.

[阿尤什]

I am Arab and I take him in high school

[chadj]

Poor explanation, forgot to mention on how the nodes are generated repeatedly.

[justicez]

The explanation is wrong! His algorithm is no difference with breadth first search!!!