00:00 Difference between uninformed and informed searching 01:10 Travelling Salesman Problem 02:09 The brute force method in uninformed searching leads to exponential time complexity. 03:16 Heuristic method is used in informed searching to solve NP problems efficiently. 04:24 Using heuristic method to solve problems in polynomial time 05:15 Using heuristic in searching can reduce time complexity 06:20 The solution is time-consuming but guaranteed to be optimal 07:17 In informed searching, A* algorithm and best first search are important
Searching girlfriend's house without letting her know about it is the example of uninformed search. But by asking for help from her bestfriend can let you follow the Informed search. AI is Fun😁😁
if(typeof(you)==="deciplined"){ prompt("profitable too😅..."); beyondAvg(you); }else{ prompt("their is nothing bad in being of myType😂"); justRevise(); }
6:31 I think its incomplete not optimal. Cuz the solution is not guaranteed in informed searching. And uninformed search is complete(soln always guaranteed).
After studied DBMS,OS And now studying Ai with him so im sure about my future is in Good hand Thank you so much for always being help needy students. Love from Pakistan ❤️
please tell me one thing apne kaha 3*3 ka matrix ho to uska depth 20 hai jo 3^20 and agar 10*10 ka mtrix ho to apne bola uska depth 10^24 hai agar b^d ke hissab se b ki value 10 hai to kya jo iska matrix hoga woh 10v 10 ka hoga kya and yadi 10v10 ka matrix hoga to oviously depth 24 ho hi nhi sakta please reply iam confuse
bro why you dont upload all the topics of artificial intellegence by the way your teaching method is good and plzz upload all the remaining topics of artificial intellegence
sir g iss course mein aap ne environment types nahi kerwayi hain jese k determinitic vs stochistic, episodic vs sequential, discrete vs continuous, static vs dynamic, known vs unknown,. single vs multiagent, fully vs partially observable. Kindly inn pe bhi videos bana k playlist mein add ker den
00:00 Difference between uninformed and informed searching
01:10 Travelling Salesman Problem
02:09 The brute force method in uninformed searching leads to exponential time complexity.
03:16 Heuristic method is used in informed searching to solve NP problems efficiently.
04:24 Using heuristic method to solve problems in polynomial time
05:15 Using heuristic in searching can reduce time complexity
06:20 The solution is time-consuming but guaranteed to be optimal
07:17 In informed searching, A* algorithm and best first search are important
Thanks sir love from Pakistan 💗💗💗💞💞
Searching girlfriend's house without letting her know about it is the example of uninformed search. But by asking for help from her bestfriend can let you follow the Informed search. AI is Fun😁😁
Bhai tu desh badlega 🙌🙌🙌
😂😂
That's called stalking my brotha 😂😂
😭😭😭
😂 correct 💯
Gurujee shandar jabardast zindabad
Online class better than college ❤️
I'm agree 💯
Try some English lectures online
@@coder_rancho 😂😂
This is what online class is doing to our future
if(typeof(you)==="deciplined"){
prompt("profitable too😅...");
beyondAvg(you);
}else{
prompt("their is nothing bad in being of myType😂");
justRevise();
}
So lovely presentation...thanks bro. watching from Bangladesh.
Glad to hear from Bangladesh..
Always osm sir. Thank-you so much
thank you so much❤ from Pakistan 🇵🇰
Anna E Pata na kosame rasillu aanipistandii superb 😢 keep it up anna 👏👏
Great method.... jazakallah
Thank you man! I've pressed like for english subtitles
Bahut accha explain kiye h sir
V.nice sir....😊👌👏🙏
Great helpful lecture
Really helpful bhaiyya thanks for yr
Awesome vedios ♥️
A person without Google map is called uninformed searching and a person with Google map is called informed searching 😊😉
Thank you sir🙏
Well done😂😂
your all videos are very helpful and lots of love to you
I like your video before watching cuz I know you wouldn't disappoint me❤
Gurujee shandar jabardast zindabad
Thank you Sir! The whole AI series is really beneficial :)
Thank you very much sir 🙏🏻
I wish i could use brute force method while finding a girlfriend
You will😊
When 😂@@lotusjoshi
@@pqrstwxyz1175 may be someday 😇😇
you have to add both algorithms
good job keep it up
So sweet presentation and my doubt are cleared by watching this video.
i;m from srilanka i'cant understand hindi but i get some knowladge...good work😉
I would like to pay my college fees to this channel , thank you sir great work !!!
thank you sir
it really helps up
Why we dont have teacher like you in colleges who can teach concepts with realistic knowledge rather than just giving theory knowledge.
Thnkuuuu sirji😇
Thanks a lot tomorrow is my exam n this question help me a lot.. thank you so much❤
Which exam
@@preetcreation5667 artificial intelligence
@@syedsajid4474 ok which class
@@preetcreation5667 mca
@@preetcreation5667 In which class you know?Which exam?
Thanks you thank you so much sir it's a very helpful and valuable for AI student 😘 you solve my whole problem 😍
well explained sir really during exam times life saving explanation of subjects.
So, we can say uninformed search gives optimal solution??
Your teaching ability and knowledge ability are too good. You must write your books in your language from which we cam do revision.
Kash zindagi mei Heuristic search lagake direct goal state pe pohoch jata, itna hurt nahi hona parta🥲
Bhai zindagi blind search nahi hoti... Aapne khud apna map (heuristic) talaashna hota hai.
Best concept explanation ever...👍
I just love the way you teach....best explained thank you✌
Very good lectures. I am from Pakistan
the innovative approach Aliagents is taking with tokenized AI agents is seriously next level
How I wish this could have been in English because I can tell that his explanations are top notch or cream de la cream
Sir, you can learn hindi. Then you can get plenty of this type of content.
And hindi is easy than AI 😂
@@deepankerrawat6170 Sir he/we are here to learn AI not Hindi, Don't suggest or command us what to do !
@@devadakshanvenkatesan5566 its clearly a joke.
@@elitesquad8231 😂😂
6:31 I think its incomplete not optimal. Cuz the solution is not guaranteed in informed searching. And uninformed search is complete(soln always guaranteed).
u r my best tutor
THANKS SIR JI✌✌🙏🙏
Bravo! Can't be explained better than him
Thank you very much, sir.
Nice explanation
Pls pls sir python for data science k video rakho
Good sir
It's helpful for me
After studied DBMS,OS And now studying Ai with him so im sure about my future is in Good hand Thank you so much for always being help needy students.
Love from Pakistan ❤️
Wonderful
Thank you so much !! 😍😍 🙏♥
Thank you🌸
Thank you sir🙏🙏
Really helpfull sir 🧡
holy shit ...stil the best explanation after so many years
easy peasy !!! Thanks !!
Way of teaching amaizing 👌👌👌
thanks sir!
THE BEST TEACHER EVER ....❤ from Pakistan 🇵🇰
Thanx a lot sir....😍😍
Thank you so much 💓 💗... 💗 💛
Nice
Tnxxxx a lot, I solute you. best teacher
thank you Sir from Pakistan ❤
I understand very clear in your videos thanks sir
loving the way Aliagents is blending AI technology with real world applications
3:59 - NP: Non-deterministic Polynomial. Isn't it?
please tell me one thing
apne kaha 3*3 ka matrix ho to uska depth 20 hai jo 3^20
and agar 10*10 ka mtrix ho to apne bola uska depth 10^24 hai agar b^d ke hissab se b ki value 10 hai to kya jo iska matrix hoga woh 10v 10 ka hoga kya
and yadi 10v10 ka matrix hoga to oviously depth 24 ho hi nhi sakta
please reply iam confuse
Thanks sir g 👍
"thank you bro thank you very much for the notes"
U cleared my concept so nicely...🤗
Thank you bro 😊
thank you man tomorrow is my exam . i am from bangladesh
All the best
Greedy best first search kya informed search hai?? means there are 4 types of informed search?
Thanks for saving my time! it helped me a lot in exam
Thanks ... Clear ALL the Points in Very Easy Manner...
👍😊
Sir please can you explain in short what is optimality & completeness ?
Best teacher💓
Can you pls explain depth limit search
nc explanation sir
Thank god ....AIKRR SUBJECT VIDEO'S ARE AVAILABLE. I thought there will be no video about this subject
thankq sir v much
NP does not mean Non-Polynomial. It is Non-Deterministic Polynomial
Sir, please create a video series on automata theory
Thanks Sir
Thanks a lot sir
Thank you sir
best on youtube
Thanksssssssssssssssssssssssssssssssssssss Loveeeeeeeeeeeeeeeee You... You made it easy for me.
nice way to teach! thanks for making videos in Hindi it will be helpful for many...
Very nice but can't Understand that y we have used factorial in TSP?
tomorrow is my exam .. thank you so much
Thank you
bro why you dont upload all the topics of artificial intellegence by the way your teaching method is good and plzz upload all the remaining topics of artificial intellegence
Nice pentagram 1:47
Thanku sir❤
please sir uninformed search ki example krwa dye please
Undesirable person👍👍 great explanation
sir g iss course mein aap ne environment types nahi kerwayi hain jese k determinitic vs stochistic, episodic vs sequential, discrete vs continuous, static vs dynamic, known vs unknown,. single vs multiagent, fully vs partially observable. Kindly inn pe bhi videos bana k playlist mein add ker den