L22: Iterative Deepening Depth First Search in Artificial Intelligence with Solved Examples
ฝัง
- เผยแพร่เมื่อ 5 พ.ค. 2020
- Full Course of Artificial Intelligence(AI) - • Artificial Intelligenc...
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:
Facebook: tiny.cc/ibdrsz
▶️ Links for Hindi playlists of all subjects are:
Data Structure: tiny.cc/lkppsz
#DBMS : tiny.cc/zkppsz
#Java: tiny.cc/1lppsz
Control System: tiny.cc/3qppsz
Computer Network Security: tiny.cc/6qppsz
Web Engineering: tiny.cc/7qppsz
Operating System: tiny.cc/dqppsz
EDC: tiny.cc/cqppsz
TOC: tiny.cc/qqppsz
Software Engineering: tiny.cc/5rppsz
DCN: tiny.cc/8rppsz
Data Warehouse and Data Mining: tiny.cc/yrppsz
Compiler Design: tiny.cc/1sppsz
Information Theory and Coding: tiny.cc/2sppsz
Computer Organization and Architecture(COA): tiny.cc/4sppsz
Discrete Mathematics (Graph Theory): tiny.cc/5sppsz
Discrete Mathematics Lectures: tiny.cc/gsppsz
C Programming: tiny.cc/esppsz
C++ Programming: tiny.cc/9sppsz
Algorithm Design and Analysis(ADA): tiny.cc/fsppsz
E-Commerce and M-Commerce(ECMC): tiny.cc/jsppsz
Adhoc Sensor Network(ASN): tiny.cc/nsppsz
Cloud Computing: tiny.cc/osppsz
STLD (Digital Electronics): tiny.cc/ysppsz
Artificial Intelligence: tiny.cc/usppsz
Links for #GATE/#UGCNET/ PGT/ TGT CS Previous Year Solved Questions:
UGC NET : tiny.cc/brppsz
DBMS GATE PYQ : tiny.cc/drppsz
TOC GATE PYQ: tiny.cc/frppsz
ADA GATE PYQ: tiny.cc/grppsz
OS GATE PYQ: tiny.cc/irppsz
DS GATE PYQ: tiny.cc/jrppsz
Network GATE PYQ: tiny.cc/mrppsz
CD GATE PYQ: tiny.cc/orppsz
Digital Logic GATE PYQ: tiny.cc/rrppsz
C/C++ GATE PYQ: tiny.cc/srppsz
COA GATE PYQ: tiny.cc/xrppsz
DBMS for GATE UGC NET : tiny.cc/0tppsz
I was struggling until I found your video, explained clearly unlike other creators of same topic. Thanks
It is very similar to DFS except we are using just level here.
Waah great work sir
It is also called progressive deepening search
Thnks a lot ji
Thanks sir🙏🙏
Sir but greedy search is also combination of bfs and DFS?
Thanks sir
❤️❤️❤️
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
Did you got the ANSWER for this question?
you then have to add a stopping condition for the algorithm
What pens are you using?? I want them
uniball gel pen
I think it's the combination of DFS and DLS
No. Iternative deepening is analogous of BFS. Because at each depth level whole nodes in a level are expanded
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.
The space complexity of BFS is too high
you said that here is combo of BFS & DFS. but where is BFS ?
i see only DFS with increasing limit. Explain plz
Because all the nodes are expanded at each level, the algorithm is complete and
optimal like BFS, but has the modest memory requirements of DFS
@@iamnatlina amazing explained. Precisely worded.
Iterative depending a* yehi hai topic?
Nope iddfs
2x
please make pdf for ai noted pdf
throughout the life silence for those 10 scums who have disliked this awesome video.
Why don't you change the title into other language?
This is not English language at all.
because in India we search in English language
plz lemme know if the answer for I being the goal node is S>A>D>F>H>B>E>G>I?
Roses are red
Violets are blue
Your title is in English
Your content should be too
no :(
exactly
bro had fire
Tomorrow exam😅
Please record your videos in English.
No