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

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

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

10 ай бұрын

very helpful comment.

@kaushalganatra4208

10 ай бұрын

Thanks dude!

@oldschoolgamer6941

7 ай бұрын

It was definitely helpful, thank you

@abhishekdharwad5042

7 ай бұрын

Thanks man

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

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

I did my assignment using your explanation! Thanks

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

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

Understood well. Thank you ma'am 😊

simple and straightforward. Many thanks

You have explained this very efficiently, thank you!

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

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

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.

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

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

Very useful for Exams.Thanks a Lot!!

This was very helpful, thanks so much!

Thanks alot for this great efforts … very beneficial video

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

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

@jubileemanlunas1672

2 жыл бұрын

I agree

awesome mam , understood clearly :)

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

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

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

right to the point; very good

U made it very simple to understand thanks❤

what to do if the hold value is smaller than the goal state value ?

Thanks a lot for good presentation🙌

Thanks for keeping it so simple!

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

Really simple explanation, thanks!

How do u get that hurestic values mam

How would you assign the heuristic value ...? Can any give me answer

The explanation was very clear!

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

This is a remarkably clear explanation!

@wisk379

Жыл бұрын

IK right! very solid explanation!

what a good presentation mam easy way

How you are putting h(n)in state table box

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

How did you take h(N) values

whsi is the one giving the heuristics now ?

thanks its help full a loot , easy to understand

Very well explained ma'am thank you😀

Very Good Video, easy to understand

Great video! Way better than my professor

When should we use the heuristic value of S?

You are the best. Thank you ma'am

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

Mam direct bhi to S se G ka path nikalta haina

simplest example, thank you madam.

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

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

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

@SolutionHunterz

Жыл бұрын

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

@Giburozu

7 ай бұрын

​@@SolutionHunterzu found the answer?

how to calculate the heuristic value

Best and easy explanation 🤩

how we calculate h(n) value plz tell me?

Very helpful , thanks 🙏

S equals to 5 how?? Please explain

How is heuristic value taken from

Really good explanation and method 👍

Thanks for this I understood this at one shot

excellent explanation thanks ma'am from ethopia

Thank you so much saved me for my exam!

What if cost of B -> D and D -> G is 1 and 1 respectively?

Thank you so mch. You explained this nicely

Very short and to the point👍

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

Amazing Thanks for the video

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

@Kirukku_paiyan_07

5 ай бұрын

*whole

Thank u teacher.it helped me a lot.

Can someone explain why at the beginning we say S is 5 while we have SG=10 ?

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

Mass mam thanks for teaching clearly

How to find the h(m) values

Clearly explained! Thank you!

Mam , How to calculate the h(n) value here?

@yairbarak10

2 жыл бұрын

From what i have read the h(n) value can be calculated in various ways, depending on the situation. For example if you need to find the shortest path on a map, you might want to choose the h(n) value to be the euclidean distance between the next node and the target node. The quality of the A* algorithm is usually determined by how well h is defined.

@SharathsooryaBCS

2 жыл бұрын

@@yairbarak10 thank you

@shyamkulkarni8710

2 жыл бұрын

mam don't comment take lec or leav it & no for doubt solving in comment section its on for tp or els it would be off

Very easy to understand!

Why are the nodes weighted?

you're the best! thank you so much

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

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

Informative 👍💝

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

3 жыл бұрын

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 :)

It is a good video, thank you

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.

How to find heuristic values

@Arus_Vlogs.

Ай бұрын

Given in question

@expecttheunexpect6102

Ай бұрын

Ok

How we are taking h(n) values

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

How to take heuristic valu mam

Great tutorial 👍

Top Explanation !!

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

what if the held values are smaller

Y u didnt use open and close list

Thank you, Mam. for the wonderful explanation

@education4uofficial

3 жыл бұрын

Thanks for liking

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

2 жыл бұрын

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.

Inka 2 paths vunnai kada to reach goal node through D

How to take heuristic values

How i calculate h(n)