A* (A Star) Search and Heuristics Intuition in 2 minutes

Created by Kamyar Ghiam and Anish Krishnan:

[phlooph]

bro dropped one of the greatest algorithm explanation videos and then left

[abu-bakrmohamed]

This deserves much more views, best explanation i have ever seen, maybe even the only one that explained the meaning of Heuristic data

[zhengfu-ymeg]

That's an amazing example and the clearest illustration😁.Make me understand it so quickly

[aryoseno]

Hands down the best explanation about A* algorithm on Youtube so far.

[RealMadrid]

This was the best explanation I've seen on Youtube! So intuitive!

[AnishKrishnanPlus]

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.

[willCrazy]

I really love that you explained the heuristic as the smell of cheese. I was struggling at understanding that concept

[drewandfriendsproject]

It's 5 am and I have a midterm on this at 1pm with a shift from 9am-12pm. Thank you

[rayankamdem]

I am amazed at how simply such a seemingly complex topic was explained. Best explanation on A* so far!

[vlad_ussr]

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.

[Shaans]

LMAO bro 45 minutes literally in 2 minutes. This is nuts. Thanks for this

[li-pingho]

This is absolutely the best tutorial of a* algorithm I've seen in youtube. This video deserve more views

[StewezMC]

The best explenation of the A* algorithm I've ever found! +1

[anathema]

icb a mouse and a piece of cheese helped me understand an algorithm so much

[duncancamilleri]

Gold. You just made it so easy for everyone in such a short time. Thank you very much. You've earned a subscriber.

[austinkwon]

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!

[FlyNadir]

Oops. It was that easy but no one explained as you men. Thanks ❤❤❤

[zaynabb.]

this explained it better than my professor, tysm

[enronenron]

bro just explained 50 mins lecture in 2 mins that I watched at 2X i.e a minute.

[kacy]

Great explanation. So it's just a priority queue that prioritizes nodes that are closer to the goal.