Created by Kamyar Ghiam and Anish Krishnan: Kamyar Ghiam: kamyarghiam@gmail.com Anish Krishnan: anish-krishnan.github.io/
Пікірлер: 60
@phlooph397110 ай бұрын
bro dropped one of the greatest algorithm explanation videos and then left
@abu-bakrmohamed1707 Жыл бұрын
This deserves much more views , best explanation i have ever seen , maybe even the only one that explained the meaning of Heuristic data
@darkside3ng Жыл бұрын
agreed!!!
@sourabhkothari70148 ай бұрын
agreeeeed
@aryoseno112 жыл бұрын
Hands down the best explanation about A* algorithm on KZfaq so far.
@AnishKrishnanPlus4 жыл бұрын
Q: What’s a good heurisitic function? A: A good heurisitc function does not overestimate the distance to the goal. This is known as admissibility. Running A* with an admissible heuristic function will always return the shortest path to the goal state. Q: How I get the values for a heuristic function? A: A heuristic value represents the estimated distance from the current node to the cheese. Imagine you’re in a room and you can smell food in the other room. You can just guess how far you are from the food in meters or some other unit of measurement. As long as your estimate is equal to or below the actual distance to the food, the A* search algorithm will work. In more complicated settings, like Pacman, you can estimate the distance between objects using something like the Manhattan distance.
@fangasteraio71516 ай бұрын
i know it has been many years since your upload, but still, i would like to add that a heuristic can be applied but A* will not always find the min path. This can happen IF the graph does NOT contain Euclidian distances. In that case, the heuristic must comply to an even more strict constraint named consistency. Stated as : abs( H(x,G) - H(y,G))
@RealMadrid21364 жыл бұрын
This was the best explanation I've seen on KZfaq! So intuitive!
@JadeWinters023 жыл бұрын
I agree. Best yet
@adityathakur37483 жыл бұрын
True
@willCrazy76881 Жыл бұрын
I really love that you explained the heuristic as the smell of cheese. I was struggling at understanding that concept
@austinkwon8259 Жыл бұрын
Wow, have tried hard to understand it for like an hour and finally found this video. get me understood just in 2 mins, thanks a bunch!
@rayankamdem67382 ай бұрын
I am amazed at how simply such a seemingly complex topic was explained. Best explanation on A* so far!
@drewandfriendsproject Жыл бұрын
It's 5 am and I have a midterm on this at 1pm with a shift from 9am-12pm. Thank you
@duncancamilleri86142 жыл бұрын
Gold. You just made it so easy for everyone in such a short time. Thank you very much. You've earned a subscriber.
@vlad_ussr83903 ай бұрын
The best explanation ever for A* algorithm. I have been confused how it works on a graph and not a node grid and finally I see.
@StewezMC2 жыл бұрын
The best explenation of the A* algorithm I've ever found! +1
@Shaan11s4 ай бұрын
LMAO bro 45 minutes literally in 2 minutes. This is nuts. Thanks for this
@matthewblom1620 Жыл бұрын
Thank you, really good. Had a 3 minute or so video for Dijkstra and was looking for something quick as well for A*.
@li-pingho14413 жыл бұрын
This is absolutely the best tutorial of a* algorithm I've seen in youtube. This video deserve more views !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
@BellaMichel Жыл бұрын
Cheers to you sir! I finally understand heuristics intuition.🙂
@FlyNadir5 ай бұрын
Oops. It was that easy but no one explained as you men. Thanks ❤❤❤
@DevFTW2 жыл бұрын
Great video with very simple explanation!
@Marvindao3 ай бұрын
that was such a nice way to introduce this concepts.
@playloud002 жыл бұрын
super nice! what an explanation.
@minhthuhuynh50677 ай бұрын
I'm glad that finally I can find this video
@seddikio1282 Жыл бұрын
Man we need a whole explained in 2 min playlist XD
@zaynabb.51405 ай бұрын
this explained it better than my professor, tysm
@ogradus3 ай бұрын
20min concept in 2min! ❤
@covan32898 ай бұрын
you are my god, thank you so much my brother
@kacy6014 Жыл бұрын
Great explanation. So it's just a priority queue that prioritizes nodes that are closer to the goal.
@enronenron24114 ай бұрын
bro just explained 50 mins lecture in 2 mins that I watched at 2X i.e a minute.
@krishnareddy6792 Жыл бұрын
you explained it very clearly 👏👏👏
@spalonamiotelkadokurzu3892 Жыл бұрын
Brilliant Explanation, shame it doesnt have more views
@sujith_TwiceOnce4 ай бұрын
Great Explanation. Good one.
@andreranulfo-dev8607 Жыл бұрын
A very interesting analogy.
@mikec93339 ай бұрын
Thank you!
@dabocousinАй бұрын
Great video
@steff420 Жыл бұрын
very nicely explained!
@As-iy2ki8 ай бұрын
But how did you assign values for the distances between nodes?
@iaroslavtretiakov17557 ай бұрын
Woah, super
@wackyweights68812 жыл бұрын
holy shit that was an amazing analogy
@emirhanbilgic2475 Жыл бұрын
amazing explanation...
@Ðogecoin Жыл бұрын
Dude thank you so much.
@wansuliu43055 ай бұрын
Great❤
@modetechno77285 ай бұрын
I get the concept, but HOW do you estimate a distance when we don't know?
@yutao19825 ай бұрын
Does Q* mean Queue (Heap) + A*? Amazing!!!
@the-g8-eye8 ай бұрын
holy cow
@masterkill1609 Жыл бұрын
nice explanation
@markvalman832510 ай бұрын
good one
@LoretoGonzalez-Hernandez Жыл бұрын
Who was the original creator of this video to whom credit is due, from the accent I know that it is not you who explains the video. I am interested in the content of this creator, could you please give the link or the name of the author?
@AnishKrishnanPlus Жыл бұрын
This video was created by Kamyar Ghiam and me. You can find our details in the description of this video.
@LoretoGonzalez-Hernandez Жыл бұрын
Thank you for the information, I do really appreciate it
@anthonyandriano4 жыл бұрын
The most important part of this was not mentioned at all. How are the heuristic and distance values initially seeded?
@kamyarghiam96764 жыл бұрын
Right. I think in a 2 minute video, you have to pick and choose what’s the most important thing to learn. The goal of this video was to try to give intuition behind why we use heuristics and what they actually represent, and it never claimed to cover heuristics extensively. Plus, I think your question was actually clarified in OP‘s comment above.
@anthonyandriano4 жыл бұрын
Kam Because adding eight seconds to the video to explain how the numbers are generated would have been too much. Yeah, okay. You also missed the part of my question asking about the distance. Thanks for your passive-aggressive response, though.
@kamyarghiam96764 жыл бұрын
Hi Anthony. Sorry, I did not mean to come off as passive aggressive. You’re correct. It didn’t mention the part about distances.
@benhardsim86292 жыл бұрын
It depends, but one way to determine heuristic value is to calculate the distance between the point where you are standing and the end goal and add it to the total travelled node. Another way to calculate heuristic value is using Manhattan distance.
@abdu11ahh9 ай бұрын
and my Dumb as teacher couldnt explain it in 30 mins