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)
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.
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.
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
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
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.
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 :)
The method used is called “manhatten distance” I think, it is H = (x1 - x2) + (y1 - y2) X being x coordinate, y being y coordinate, and 1/2 beibg start and end node respectively (they dont have a value, the numbers are just there to signify the difference between the first and second node positions) ex: first node is 1 x 1 y, second node is 6 x 6 y H = (1-6) + (1-6) H = -5 + -5 H = -10 (turned into positive)
h(n) is the "estimated distance" to the goal. We don't know the actual distance since that is what we're trying to find so we use some other method available to us to create an estimate to help us speed up our search. h(n) can be calculated in many ways depending on the scope of the problem (so it can really be thought of as arbitrary), but in the real world we can create h(n) by getting, for example, the Manhatten distance: the rectangular distance (ie travelling along the x axis then along the y axis and adding these 2 distances up) from one node to another but anything can be used to create h(n) as long is it is *admissible*!
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.
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
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?
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
@@NavjotKaur-pk4gx a way you can create estimates is to place your graph nodes on a grid that have distance between them associated with the edge weights. You can then use the pythagorean theorem to calculate distance between nodes on the graph, which you can use for your estimate function h.
i know im not the only computer science major preparing for a test last minute
yes xD
dood i literally have 1hr for my exam and im starting the 1st topic here
me too
@@CSSANJAYR Bro , I'm same condition now.Just giving my first offline exam in btech. Please say how you was your exam
@@arjanhazra7255 yep ,just understand the concepts don't memorize. relative the concepts with an example sum work it out
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)
Thanks buddy
very helpful comment.
Thanks dude!
It was definitely helpful, thank you
Thanks man
I don't know what I'd do without Indian youtubers explaining these topics so well
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
I searched many videos and I can surely say this is the best explanation about the a* alg.
I agree
simple and straightforward. Many thanks
This was very helpful, thanks so much!
Your explanation is smooth like butter, madam! 💜
Very clean and clear explanation
tq aka , very useful for exams , got my exam tomorrow, thanks again!
Thanks a lot. I was watching a lot of resources only to get confused. This video is clear.
This was very helpful 👍🏿.. thanks so much ♥️
Understood well. Thank you ma'am 😊
You have explained this very efficiently, thank you!
5hours before exam😂
15mins before exam lol
1 second b4 exam
In exam hall😮
1day before exam 😅
This is a remarkably clear explanation!
IK right! very solid explanation!
Very useful for Exams.Thanks a Lot!!
It was simple and understanding easily thank you for your explanation it was helpful for my tomorrow exam
Can you please explain remaining concepts of Artificial intelligence
Which will be very helpful for our exams
Thanks alot for this great efforts … very beneficial video
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.
right to the point; very good
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?
the same process
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.
Thanks , explained v well. Thanks for creating video and sharing with us.
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
awesome mam , understood clearly :)
U made it very simple to understand thanks❤
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 a lot for good presentation🙌
Thanks for keeping it so simple!
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.
The explanation was very clear!
Thank u so much...... nicely explained mam...........
Really simple explanation, thanks!
I think i can't forget this for the hole life ..😊😊🎉thanks mam its very good explanation..👍
*whole
I can only tq very much pls continue ur nature of teaching mam
First sentence m hi mistake ...tree never contains cycles ... DEFINITION OF TREE says tree is a directed acyclic graph
Best explanation ever
You are the best. Thank you ma'am
Clearly explained! Thank you!
thanks its help full a loot , easy to understand
Thank you, Mam. for the wonderful explanation
Thanks for liking
Very well explained ma'am thank you😀
how did she make the heuristics and state table 2:00 ? like did she give random values ?
I am wondering the same, like how to get heuristics values. Is that based on calculation or just random values
@@SathishKumarrzu found the answer?
what a good presentation mam easy way
Best and easy explanation 🤩
Very Good Video,
easy to understand
Thank you so mch. You explained this nicely
Really good explanation and method 👍
simplest example, thank you madam.
Very helpful , thanks 🙏
Thank u teacher.it helped me a lot.
Thanks for this I understood this at one shot
Very short and to the point👍
Top Explanation !!
Very easy to understand!
What you would do if one of the values you put in "hold" would be less then the value 6 (s->a->c->g) ?
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 :)
mam why did you not check sabdg ? in some other case it might have been shorter, so should we take that part?
you're the best! thank you so much
Mass mam thanks for teaching clearly
Thank you so much saved me for my exam!
excellent explanation thanks ma'am from ethopia
Mam, for suppose if we have holded value is less than the 6 then what we have to do mam?
It is a good video, thank you
Informative 👍💝
Great tutorial 👍
Wonderful!
Thank for the lesson. Will one of you help me understand
thank you it was helpful!
How are h(n) values determined? h' is an estimate so is it arbitrarily chosen or is there method for estimation?
The method used is called “manhatten distance” I think, it is
H = (x1 - x2) + (y1 - y2)
X being x coordinate, y being y coordinate, and 1/2 beibg start and end node respectively (they dont have a value, the numbers are just there to signify the difference between the first and second node positions) ex: first node is 1 x 1 y, second node is 6 x 6 y
H = (1-6) + (1-6)
H = -5 + -5
H = -10 (turned into positive)
h(n) is the "estimated distance" to the goal. We don't know the actual distance since that is what we're trying to find so we use some other method available to us to create an estimate to help us speed up our search.
h(n) can be calculated in many ways depending on the scope of the problem (so it can really be thought of as arbitrary), but in the real world we can create h(n) by getting, for example, the Manhatten distance: the rectangular distance (ie travelling along the x axis then along the y axis and adding these 2 distances up) from one node to another but anything can be used to create h(n) as long is it is *admissible*!
S to a =1, a to b = 3, b to d = 5, d to g = 2
why you set the heuristic value of D with 6 when the cost from D to G is 2? Heuristic value must UNDERESTIMATE the cost isn't? CMIIW
I think using this heuristic is valid, however, this makes the heuristic inadmissible. For admissible heuristic, for every n, h(n)
connect s to g is already bullshit , which is shortest path , unless he mean curve one
Mam , How to calculate the h(n) value here?
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.
@@yairbarak10 thank you
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
superb explain mam
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
S equals to 5 how?? Please explain
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?
Nope
Great Work🙏🙏🙏
عاشت ايدج شرح كلش حلو😊
lovely explanation
If I pass my exam tomorrow
You are the reason 💪🏻
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
How do we get heuristic value?
Actually the hueristic value is an estimated value that is taken from current node or point to Goal point.Like an assumtion!
most important thing,its already given in question
h(n) and g(n) are estimated values means we can take any number???
@@NavjotKaur-pk4gx a way you can create estimates is to place your graph nodes on a grid that have distance between them associated with the edge weights. You can then use the pythagorean theorem to calculate distance between nodes on the graph, which you can use for your estimate function h.
@@jeffreystevens8042 ok thanks sir
Thank you aka :)
how to calculate the heuristic value
Just perfect
Mam i reached 8th semester aapka ek baar m samajh m aata h specially algorithm part
When should we use the heuristic value of S?
what to do if the hold value is smaller than the goal state value ?
But what should we do if it is greater than the hold value
If there is a situation like that
How to calculate h(n) value s is 5, a is 3 how to calculate
How would you assign the heuristic value ...? Can any give me answer
wow what a explanation.The teacher we all want
What if cost of B -> D and D -> G is 1 and 1 respectively?
How do u get that hurestic values mam
very well tought thank you
How did you take h(N) values
Thanks a lot ma'am
How you are putting h(n)in state table box