L22: Iterative Deepening Depth First Search in Artificial Intelligence with Solved Examples

In this video you can learn about Iterative Deepening Depth First Search in Artificial Intelligence with Solved Examples, Advantages, Disadvantages. This topic is very important for College University Semester Exams and Other Competitive exams.

Artificial Intelligence Video Lectures in Hindi

👉 Follow us on Social media:
▶️ Links for Hindi playlists of all subjects are:

Links for #GATE/#UGCNET/ PGT/ TGT CS Previous Year Solved Questions:

[bibek-bhujel]

I was struggling until I found your video, explained clearly unlike other creators of same topic. Thanks

[chiragahir]

It is very similar to DFS except we are using just level here.

[frontback]

It is also called progressive deepening search

[amreenmohd]

If there are multiple goal nodes like here 'g' is the goal and if g is present even in the level 3 then what would be the solution

[shreeganesh]

Sir but greedy search is also combination of bfs and DFS?

[brave]

I think it's the combination of DFS and DLS

[ashichauhan]

plz lemme know if the answer for I being the goal node is S>A>D>F>H>B>E>G>I?

[saadmanahmed]

you said that here is combo of BFS & DFS. but where is BFS ?
i see only DFS with increasing limit. Explain plz

[sararafi_]

what if goal node was f then path would be SADF?

[prajwaldeepkhokhar]

its clearly more inefficient than BFS and is working exactly in similar manner, why would we even use this technique sir, i mean where would it be efficient? BFS is clearly faster than this as it isn't wasting time by traversing same nodes over and over.

[singhjeet-jqsy]

Iterative depending a* yehi hai topic?

[BlinkDrive]

Why don't you change the title into other language?
This is not English language at all.

[panagiotisiatrou]

Roses are red
Violets are blue
Your title is in English
Your content should be too

[vgxgaming]

throughout the life silence for those 10 scums who have disliked this awesome video.