Iterative Deepening Depth First Search in Artificial Intelligence in Hindi 🔥🔥
ฝัง
- เผยแพร่เมื่อ 22 ส.ค. 2021
- This video is about Iterative Deepening Depth First Search also called Depth First Iterative Deepening in Artificial Intelligence in Hindi. This topic is from the subject Artificial Intelligence and Soft Computing in Hindi.
Purchase notes right now, more details below:
perfectcomputerengineer.teach...
*Artificial Intelligence & Soft Computing Playlist: • Playlist to Artificial...
*Big Data Analytics Playlist:
• Playlist to Big Data A...
*Digital Signal & Image Processing Playlist:
• Digital Signal & Image...
*My Gear:
Camera: amzn.to/2U2cZHx
Mic: amzn.to/2UDFR8Y
Tripod: amzn.to/3i5HQLv
Let's connect
Instagram: / planetojas
Really One Of The Best Conceptual video . Your all lacture are best ❤❤❤❤.Thank you Sir
Boss kya jabardast sikhate ho .....Great
Thank you for saving my semester :)
Excellent explanation
Great explanation.
Thank you sir.
very nice teaching👌👌👌
Nice explaination sir
thanks bro 😍
Really great that you have teach here in free of cost.......✨
Kudos to you buddy
Wow bhut achii traa smj ayio thnkuu
Thank you so much Saima please share the video if possible 🙂
Great
Thank you 🙏❤
Super
ty sir
Brother OP❤🔥
How iterative deepening depth first search overcome the disadvantages of depth first search and breadth first search
Is dfid actually works same like bfs???
Sir.. Ur soo great.. Keep up this good work.. All the best🤩🥰🥰
Thanks Man, what university are you from?
@@perfectcomputerengineer vellore Institute of technology 🥰
And can I know your exam dates?
@@perfectcomputerengineer yup.. It's from 15th
Are you talking about viva? And what are the subjects you have?
1000th liker
Could you please tell us how is dfid different from bfs??? I m stuck here from past 2 days..in finding the difference
For anyone wondering with the same doubt, see when you apply iddfs you are iterating in the tree for a particular depth , your algo would not go beyond a depth (exactly what is done in bfs, where your algo first searches solution at a particular depth and only goes to lower depth if soln is not found) , and since you search in a dfs manner (search a particular node till the limit depth) . Therefore, IDDFS is a combination of DFS, DLS, and BFS.
At last thoda board k side me hatna tha aap k hum screen shot lesake.
Isn’t this similar to bfs??
IDDFS STARTS AT 3:40 THANK ME LATER
darshan sir ne suggest kiya
👏👏
@@shubhamkhose7474 Whatsup boy
@@GonpachiroKamado Come with real id
Sir aap ka explanation to accha hai but aapke face expression see aisa lagta hai ki aap jabardasti video bana rahe ho. Kindly improve your body language and expression. BIG SALUTE FOR YOUR EFFORTS.
Ok bhai I'll work on it, thanks for the feedback 🙂
That's rude bro
Bhai aise hi ye topics youtube mai mil nehi rahe aur mil bhi rahe to hardly explained hai aur tumhe expressions ki pari hai , teaching pe dhyan do muh par nehi that was rude
@@sksahinparvej5500 gavar log hai bhai, public behaviour nhi aata inhe
@@sksahinparvej5500 but, these topics are easily found on TH-cam