A Star algorithm | Example | Informed search | Artificial intelligence | Lec-21 | Bhanu Priya

a star algorithm: Informed search in artificial intelligence with example

[@molisemahasele8008]

i know im not the only computer science major preparing for a test last minute

[@tarikeld11]

yes xD

[@CSSANJAYR]

dood i literally have 1hr for my exam and im starting the 1st topic here

[@abhibhuprakash2994]

me too

[@arjanhazra7255]

@@CSSANJAYR Bro , I'm same condition now.Just giving my first offline exam in btech. Please say how you was your exam

[@CSSANJAYR]

@@arjanhazra7255 yep ,just understand the concepts don't memorize. relative the concepts with an example sum work it out

[@mateolopez5585]

I don't know what I'd do without Indian youtubers explaining these topics so well

[@alexkim-soo2845]

If you were like me and did not know what is "heuristic value". code wise: its a function that take in the node and the goal, and base on a chosen formula(Euclidean, Mathattan etc) will provide an approximate distance of this node to the goal. If assuming euclidean then its the distance taking a straight line from A node to G node, ignoring all the path that should be taken.(like an airplane/helicopter ignoring roads)

[@drex-0299]

Thanks buddy

[@SPeeDKiLL45]

very helpful comment.

[@kaushalganatra4208]

Thanks dude!

[@oldschoolgamer6941]

It was definitely helpful, thank you

[@abhishekdharwad5042]

Thanks man

[@ikemuoma8495]

Best explanation of the A * algorithm I have seen. Very good. 👍

[@aarrjunumrikar5345]

This was a very lovely and clear explanation. Thank you ma'am!

[@nadeeradulan9231]

I did my assignment using your explanation! Thanks

[@sna241]

Thanks a lot. I was watching a lot of resources only to get confused. This video is clear.

[@SaileeShingare]

Understood well. Thank you ma'am 😊

[@ibnualwi9784]

tq aka , very useful for exams , got my exam tomorrow, thanks again!

[@MATTesticle]

You have explained this very efficiently, thank you!

[@realcryptc]

This was very helpful, thanks so much!

[@user-sd7mj7oe7g]

5hours before exam😂

[@rahulreji4079]

15mins before exam lol

[@twilightangel8790]

1 second b4 exam

[@twilightangel8790]

In exam hall😮

[@shivaya__nama]

1day before exam 😅

[@aryxslayer04]

Milli second before exam

[@RRover8888]

Your explanation is smooth like butter, madam! 💜 Very clean and clear explanation

[@praveenkumarboddu6451]

Very useful for Exams.Thanks a Lot!!

[@brwaabdulrahman2263]

This was very helpful 👍🏿.. thanks so much ♥️

[@alexlu7149]

I searched many videos and I can surely say this is the best explanation about the a* alg.

[@jubileemanlunas1672]

I agree

[@alaaelbarasi8619]

simple and straightforward. Many thanks

[@user-rk5zw5of6e]

How to find heuristic values

[@Arus_Vlogs.]

Given in question

[@expecttheunexpect6102]

Ok

[@elloomii2681]

Thanks alot for this great efforts … very beneficial video

[@SamDrives]

Thanks for keeping it so simple!

[@Bill0102]

I'm blown away by the quality here. I recently enjoyed a similar book, and it was top-notch. "Game Theory and the Pursuit of Algorithmic Fairness" by Jack Frostwell

[@eklavya22k34]

Thanks , explained v well. Thanks for creating video and sharing with us.

[@ezasokotela7523]

This is a remarkably clear explanation!

[@wisk379]

IK right! very solid explanation!

[@user-tn1hb5zi5g]

U made it very simple to understand thanks❤

[@sealivezentrum]

right to the point; very good

[@srilekhakaturi3887]

Can you please explain remaining concepts of Artificial intelligence Which will be very helpful for our exams

[@psalmwelkyleconciso2366]

Really simple explanation, thanks!

[@anthonysiluvaiwinsp8204]

awesome mam , understood clearly :)

[@eminguney9714]

Thanks a lot for good presentation🙌

[@riyazahmed7907]

The explanation was very clear!

[@-saitejavarma]

It was simple and understanding easily thank you for your explanation it was helpful for my tomorrow exam

[@loganpraz2566]

Great video! Way better than my professor

[@gantasalasaivasanth6512]

I can only tq very much pls continue ur nature of teaching mam

[@aryxslayer04]

Amazing Thanks for the video

[@fujiahermawan8]

thanks its help full a loot , easy to understand

[@WindyHellLetsLoose]

One question, what if S -> A -> B -> D ->G has a less cost than S -> A ->C ->G. How would the search end up with this assumption?

[@jubileemanlunas1672]

the same process

[@momolight2468]

This is impossible because just SAB on its own has a cost of 7. So if we add the whole path SABDG it will be surely more than just SACG, which has a cost of 6.

[@sanjayrajan7949]

Thank u so much...... nicely explained mam...........

[@giftmarshallchawira241]

You are the best. Thank you ma'am

[@bajrangsharma2762]

what a good presentation mam easy way

[@user-jy7ob1jg2m]

I think i can't forget this for the hole life ..😊😊🎉thanks mam its very good explanation..👍

[@Kirukku_paiyan_07]

*whole

[@chandrakanthsrinivas8184]

Thanks for this I understood this at one shot

[@shankha9693]

Very well explained ma'am thank you😀

[@emirhanbilgic2475]

simplest example, thank you madam.

[@azik6138]

Thank you so much saved me for my exam!

[@muhammadyousaf3366]

Very Good Video, easy to understand

[@fatimaiqra2169]

Very short and to the point👍

[@eddiej204]

Am I getting this right that the HValue came from the particular node to the Target node? For example, I am at node B, and the HValue of it is 4. Meaning that from B to G (G is the target node) the approximate distance of it is 4. While approximate distance is the HValue which maybe calculated using Euclidean or Mathattan etc. Please suggest

[@annemasadi8067]

Thank u teacher.it helped me a lot.

[@IrtizaMushtaq-]

Thank you so mch. You explained this nicely

[@Greatfulone]

So the hold values are used to make sure we get the least costly path to the goal? That means we check at the end and see if we have the least costly path. Right? Is there any other time I need to review the hold values? Thank you.

[@bfranklin4302]

Thank for the lesson. Will one of you help me understand

[@TP-mv6en]

Really good explanation and method 👍

[@bandar893]

Very helpful , thanks 🙏

[@bayan3032]

you're the best! thank you so much

[@JayPatel-ou2ud]

Best and easy explanation 🤩

[@iammayurn]

Thank you, Mam. for the wonderful explanation

[@education4uofficial]

Thanks for liking

[@esraelbizuneh9756]

excellent explanation thanks ma'am from ethopia

[@SupriyaNR]

In the last step 6 can be compared with the hold values which is smaller so we kept as it is wht if the value is greater than that we should again comparing the values

[@Fionasfung]

Very easy to understand!

[@secretfairy851]

Informative 👍💝

[@badassopenpolling]

What was the mechanism to take heuristic values ????? How did you come to S - 5, A- 3 so on... What exactly is the heuristic value ??? In real time - Do we get this heuristic value to solve problems for finding paths. I gues No !! Answer is = Heuristic value is the distance from node to the Goal.

[@adityapawar6383]

Mam i reached 8th semester aapka ek baar m samajh m aata h specially algorithm part

[@lingchen8849]

Clearly explained! Thank you!

[@user-lb1fl7sh8m]

Top Explanation !!

[@quantumspark343]

Best explanation ever

[@kavya6650]

Great tutorial 👍

[@srujangowda8490]

Wonderful!

[@Sergionitr020]

It is a good video, thank you

[@saikishore5517]

Mass mam thanks for teaching clearly

[@s_kazi8202]

First sentence m hi mistake ...tree never contains cycles ... DEFINITION OF TREE says tree is a directed acyclic graph

[@puneethkamadolli423]

If I pass my exam tomorrow You are the reason 💪🏻

[@areihaile]

Great Work🙏🙏🙏

[@HOLONIA4EVER]

What you would do if one of the values you put in "hold" would be less then the value 6 (s->a->c->g) ?

[@norbertmargit6282]

Then you would keep searching on that path to see if you can find a better solution. Let's say s->a->c->g is actually 9. In this case s->a->b is 7 which is less than 9, so you need to keep looking on that path to see if you can find a shorter path than 9. The F(n) of s->a->b->d is is 14 (8+6) which is more than 9, so you can stop searching this path, beacuse you can already reach your goal in 9. However if it would be 8, then you would still need to keep looking beacuse at that moment you could still technically find a better result than 9. Hope this helps :)

[@behappybindass12]

superb explain mam

[@fernandinhovieira006]

lovely explanation

[@AliAhmed-fd2rj]

عاشت ايدج شرح كلش حلو😊

[@renukagarikapati3422]

Mam, for suppose if we have holded value is less than the 6 then what we have to do mam?

[@VikramSingh-gq5ww]

S to a =1, a to b = 3, b to d = 5, d to g = 2

[@cmrdecc6516]

Thank you aka :)

[@kirankumarkandakatla9696]

nice explanation

[@muhammadahmed4976]

mam why did you not check sabdg ? in some other case it might have been shorter, so should we take that part?

[@dyyno5578]

how did she make the heuristics and state table 2:00 ? like did she give random values ?

[@SathishKumarrz]

I am wondering the same, like how to get heuristics values. Is that based on calculation or just random values

[@Giburozu]

​@@SathishKumarrzu found the answer?

[@eliasendale-zr1gp]

thank you it was helpful!

[@tawandakamhamba14]

Just perfect

[@varanaze.]

Masha Allah ❤

[@Janush___]

Thankyou mam

[@d..9272]

S equals to 5 how?? Please explain

[@littlegirls9241]

Hai madam.Can you explain the property of binary tree. Property is sum of degree of the vertices in any trees equal to 2v-2. Since a tree with more than one vertex cannot have any isolated vertex,there must be at least to vertices of indegree 1 in the tree

[@atharvapurohit3585]

Hi, when we are passing through any node, don't we have to add the heuristic values of that node aswell? S to A to C to G so heuristic values of A and C 3 and 2 respectively, wont be added?

[@TXS-xt6vj]

Nope

[@samarthraj5676]

But what should we do if it is greater than the hold value If there is a situation like that

[@gauripalkar1617]

Plz make a video on refinement search algorithm

[@banuprakashkesavan4873]

Awesome

[@manasehnjoroge3204]

Thank you very much

[@udiptadeka562]

wow what a explanation.The teacher we all want

[@athiambonyabundi]

very well tought thank you

[@namotech6770]

how to calculate the heuristic value

[@chingkhei_thoudam]

When should we use the heuristic value of S?

[@shreyadhurde4301]

thanks really nice

[@aravindkola3208]

thank you so much mam

[@rsjawahar]

How to calculate h(n) value s is 5, a is 3 how to calculate