A* algorithm in AI (artificial intelligence) in HINDI | A* algorithm with example
HTML-код
- Опубликовано: 23 окт 2024
- 👉Subscribe to our new channel: / @varunainashots
►Artificial Intelligence (Complete Playlist):
• Artificial Intelligenc...
Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
► Operating System :
• Operating System (Comp...
►Database Management System:
• DBMS (Database Managem...
► Theory of Computation
• TOC(Theory of Computat...
►Data Structure :
• Data Structure
►Computer Networks (Complete Playlist):
• Computer Networks (Com...
►Computer Architecture (Complete Playlist):
• Computer Organization ...
►Structured Query Language (SQL):
• Structured Query Langu...
►Discrete Mathematics:
• Discrete Mathematics
►Compiler Design:
• Compiler Design (Compl...
►Number System:
• Number system
►Cloud Computing & BIG Data:
• Cloud Computing & BIG ...
►Software Engineering:
• Software Engineering
►Design and Analysis of algorithms (DAA) (Complete Playlist):
• Design and Analysis of...
►Graph Theory:
• Graph Theory
►Programming in C:
• C Programming
►Digital Logic:
• Digital Logic (Complet...
---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
► Subscribe to us on RUclips: / gatesmashers
►Subscribe to our new channel: / @varunainashots
► Like our page on Facebook: / gatesmashers
► Follow us on Instagram: / gate.smashers
► Follow us on Instagram: / varunainashots
► Follow us on Telegram: t.me/gatesmash...
► Follow us on Threads: www.threads.ne...
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:
Email us at: gatesmashers2018@gmail.com
Join Scaler Academy by InterviewBit, India's 1st job-driven online tech-versity.
Accelerate your tech skills in 6-months and land a job at the top tech companies globally.
300+ of our students have landed jobs with an salary range of 18-35 LPA at 150+ companies that include Google, Amazon & Microsoft.
No upfront payment. Pay us only after you get a high-paying job.
Live interactive online classes three days a week at night-time. Attend classes from the comfort of your home, even while working full-time
Visit our website: website link:bit.ly/3aZskvx
Follow us on RUclips: ruclips.net/user/ScalerAcademy
Follow us on LinkedIn: www.linkedin.com/school/scaleracademy/
Sir, what if f -> g cost is 1 ? Will sbfg is d resultant path or scdeg ? because we already traveled along scd neglecting sb.
Apney subscribe waley ko artificially intelligent ka support dilva do phir Duniya following karegi To Iski economy bhi aapko following karney lagegi
my teacher could not explain like this no words for you. god bless you
my friend told me he is going too much deep skip him, but I told him ''old is gold'' this Legend is my teacher since my fourth semester and now I am in the 7th semester.
thank you, sir.
and love you💗
Dude tere kitne bachche ho gye 4 saal baad
@@asianguy86 LOL😂😂
@@Sage2310 voh graduate ho fya tha usi saal byaah toh Racha liya hoga av tak
What from 4th to 7th 😂
he is my teacher since first sem of BCA and I am doing MCA Final year and i am here one night before my Exam 😅😊❤
@@Ghost_Rider_54 bro raat guzari uskw saath
U Explain step by step if anyone dont knew basic u are the best👍👍👍thanks man
No one can explain such topic like you have done.
thanks bhai❤❤
Anyone can't explain like you big brother....thanks 🙂🙂
Thanku so much sir
Aapne itna accha clear kr diya ki ab to aanand prateet hota hai AI me
Sir u are amazing person and teaching method is awesome after watching your tutorial all problems are solved and realize that Artificial Intelligence is too much easy....Very well done sir and thank you so much for being this type of teacher..... regards.
Bahut videos dekhi sir...aap ka video ek hi baar mein samajh mein aya
Your teaching way is amazing sir which help me to understand easier. Even my colleagues sir didn't teach well.Thank you sir🙏🙏❣️❣️
Gate Smashers You have got new Subscriber from Pakistan keep sharing knowledge Lots of Prayers from Pakistan
Thank You..Keep learning and sharing
Thank you so much , I study computer science at University of Kwa-Zulu Natal in South Africa, you're helping students at an international level 😁
South Africa?😯,nice
I am from India.☺️
🤝..
This is the best explanation on the A* Algo heard.
full time pe nikala video ...
thank u so much ..
clg k sab log aap k hi videos refer karte h
@@217-sritejrajulu6 ha lvde gali mat de sale iss channel pe😶
Glad to learn this algorithm so easily,
All because of you SIR.
As a game developer A* is the widely used algorithm to find the shortest path.
informative
Sahi hai
tmkc
@@rohanwarghade7111 tmkc ++
@@rohanwarghade7111 chill bhai
Thankyou sir because of you I scored well in my AI exam God bless you sir
He explains the concepts better than my PhD Professor. Thank You!
PHD : Phaltu Hai Degree
@@shreechatane9215 🤣
same case
@@shreechatane9215😂😂😂😂
What if the f->g cost is 1? Then this example does not give optimal solution, even after considering the heuristic value.
Your the best teacher that I have never seen...I am graduate now..but still no one con replace u sir.. incredible
Hello Sir i am following each assignments continue your assignments till june and include all possible tough questions subject wise by which we can crack net
I really loved your way of teaching sir. I request you please make a series on python programming language from beginning to advance course, full tutorial on machine learning and deep learning.
Please 🙏🙏🙏
yes sir, please start the tutorials on new and upcoming topics like ML, Deep Learning and Python.
We are really clueless on source, syllabus and content on such topics.
You can learn from code with harry too.i don't think he has kept python programming. Untill and unless he posts a new video,you can help yourself from code with harry.
Best vdo...teacher ki smj nhi aye the jb unho ny ye topic kraya but aap ki smj aa gye...thank you soo much
But what if edge cost from f->g is 5. so in this case our optimal path is s->b->f->g but we get scdeg??
thnkss alott sir...first attmpt pe hi concept clear ho gya......God bless u forever sir ji....nd sir m waiting u r further videos....🤔🤔
tomorrow is my paper your video helps me in clears my confusion about that topic Love from Pakistan 🇵🇰❤️💯
All the best
Legends are those who come here before semester/mid exam 😂
PS: Thanks for 1k likes guys ❤️
My exam is in 2 hours! 😂
ahhahaha
My exam is in after 1 hour 😎😂
Today is my Artificial intelligence exam😂
My exam in 1 hour 😂😂
i am BS Computer student from Pakistan . I am watching your videos from the start of my degree and now its the end of degree, still i wanna help from videos for artificial intelligence.. Thank you sir for your precious time and afford.. May You get success
sir you are the best!! i understand topic very clearly.Thank you
You are the best teacher I have seen iam cleared from 2 semester to iam in 5th semister thank u a lot
Sir
Sir, What if cost of F>G was 2? then the path SBFG would cost only 11 and it would be even shorter path then SCDEG=17 (which is our answer), so in that case the method of not exploring greater values proves to be wrong. Please answer me with whatever explaination and anyone can correct me if I am wrong.
I'm not entirely sure, but I think the heuristic function's estimate of the distance can never exceed the actual cost. For example, if the actual cost from F to G was 2, then the estimate would be 2 or less than 2. Any heuristic function that satisfies this condition is called an admissible heuristic.
what if the weight from f -> g is less than 8. Because, if it is less than 8 then at 12:10 we get less than 17 right. Also, the cost will be less than the scdeg path...
Great sir❤🙏✨, you are truly a man who made difference ❤even in minutes a full concept built
So nice explanation sir
Excellent explanation. Lots of love for you dear sir
Thank u so much sir....You are a very good teacher😊😊☺ & explain all topics in easier way...You are brilliant...You saved my semester.... I'm from Pakistan💚.
Which Uni?
complicated made simple ..thank you
This is the best explanation ever on the internet. Thanks for the video !!
Thank you sir
Wase me normally YT pr aata NHi hu kuch pdhne ke ly buT jb bhe KucH NHi smj aatA to m aap ka koi topic DekH letA hu and
I get the solution
Superbbb sir.. baki ki videos b jldi se laye. Har roj ek video plzzz
unbelievable explanation....... thanks sir
Sir, in this method I think we should calculate cost of all the possible paths to get the best cost path else it may be wrong.
I'm one of those working students. It's really informative and helpful.Thank you brother❤
We cannot deny the fact that he is the one making most engineers ❤
Baki clg wale to sahi se sikhane se rahe😒
Who all are studying for tomorrow's exam😂
Me😂
Today's* 😂😂😂
Me
I am studying for today's exam
@@Anjalivlogs_3 but abhi kaha exam hoge raat ko
You are doing great work sirji .............
Monk visits the land of Islands. There are a total of 8 islands numbered from S to G. Some pairs
of islands are connected to each other by Bidirectional bridges running over water. Monk hates
to cross these bridges as they require a lot of efforts. He is standing at Island #S and wants to
reach the Island #G. Find the minimum the number of bridges that he shall have to cross, if he
takes the optimal route.
1. Explain the cost function associated with your search in reaching the goal.
2. Choose the correct algorithm suitable for this search.3. Implement the algorithm in PYTHON
4. Print the path taken by the monk.
5. Print the minimum the number of bridges that he shall have to cross.
where i'll share graph root image with you?
can you please me for above assignment?
well explain sir...so nice of your teaching style..from pakistan
Iski heuristic value di gayi hogi ki find karna hoga?
Huge respect from Assam ,,great explanation sir
Tnq so much for .. For explaining clearly.... Listening ur explanation one time is enough...... After listening ur class i got it directly into my mind... Tnq so much sir for ur explanation... 🙏❤💐
Thanx bhot easy smj aa rhi h. Kindly agar branch and bound algo ki video hai to uska link dy djie. Mainy bhot videos dekhi lkn ksi ki ni smj aa rhi. Kl ppr hai mera
Best teacher
Bhai apke video sea jyda sikha hu compare to by clg professor
Thankyou bhai :)
Thankuu so much sir for the desired explanation really supportive for me and my exams thanku so mucH
Beautifully explained. Understood A* algorithm in one watch. Thank you for making video lectures.
Bata ab kay he a ⭐
Thank you so much.. my teacher posted a surprise test on this tomorrow.
First thing I knew was to come to this video.
😂♥️
You simplify teaching 😁
Edit: Rocked the test 🙌
very good worth watching thank you gate smashers
great sir
What a genius we have in our country. A gamechanger in education field. 😎
very very good way of teaching dear
sir yaar thanks a lot for these videos. Last semester bardiya karwa deya ap ne. Cheers
Very helpful sir...sir where I get the next part that u say in the end of this video?
i am from iit Kharagpur but need to watch your videos for semester exams . love you sir
Thank you so much for making us understand the subjects.
Hey bro videos quality best dalo please properly nahi dekhta hai or aap explanation bahut acha hai
Bestest explanation
Thnks sir the way you explain i understood in first time 👍
You are great bhaiya 🌹🌹🙏🙏👍👍👌👌🚩🚩🌹🌹
Sir, you are the greatest teacher..
Super explanation ❤
Had the goal be E, then should we've added the heuristic value in the goal state in final calculation?
No it will be zero only
how can it be O(V+E) ?? you are taking the minimum value of all then you have to use a min-heap or Fibonacci heap...which takes O(VlogE) in total...
No matter what you use you have to traverse all nodes and edges
@@comrader3668 Exactly
Where are video lectures of other logic and reasoning types?? Please make videos on them.
Please upload the video on topic water jug of AI
Thank u sir
Thank you so much sir, the best thing about your lectures is that it does not take so much time. I have studied AI in my university but you are doing a great job. Sir please give me your email.
sir AI sikhna mushkil ha kia
kis university sa BS kr rahay ho ap
plz guide me
Bht hi bahtareen samjhaya ha!
it's very good. Please explain simulated annealing.
I have a confusion. When S->B [4+14=16] then while moving towards next node, why arent we considering this value? like: SB->F [16+5+11=32] q keh hmne to SB ko already calculate kr lia tha...
Thank you so much sir ji
No words to thank uh sir Love ua way of explntn .....❤❤❤❤
sir , S->B =16, S->C = 14 sc give min so can we follow only this path (SC->D=16, SCD->E=16, SCDE->G=17) to reach goal??? jo path min cost de rha hai sirf usi ko pick kre bako ko ignore ka rskte h na?? jese apne sare path ko travel kia to exam me hume unhe travel krne ki need nhi h ??? jo initial max cost de rha h wo goal tak bhi max hi dega... m i right??? please make me correct...
wow so nice expntn thnku so much sir
thank you very much sir.. ur videos helping our sir to teach us.... but he is not telling that he is copying from ur YT channel.... #AD
Online classes bought me here
Sad Lyf😭
very easy explaination thank you very much
This is the best explanation ever 🧚♂
Superlative level of teaching.....
I watched this for internals as well for sem end exams
thankyou sir its vary important on Unity Path Finding Technique
Thankuuuu sir for this video through I understood the concept of A*algorithm
Amazingly explained Sir...thank youuu!!
Nice effort. Complete explaination in shortest video. Great 👍
The best 👌
Nobody has explained this topic like this thanku❤
Love u sir I cover my whole sylybuss by ur videos. Love from.pakistan
Thank U Sir !! As always u explained it in the easiest way !
So many videos I saw regarding A* algorithm but this one is the best. Explanation is just phenomenal.
Should we have to remember all these no.( Heuristic value and cost )
Thank you for such a thorough explanation