A* Search

U r a genious

A godsend. This is saving me in my CS Discrete Math class, thank you so much!

How to do the heuristic estimation? Isn't that the key? Extremely shock can't find explain how to get the heuristic estimation while no one mention that. Am I missing something?

If at some point you get a node having better A* score and the node was already visited (but has inferior A* score than the most recent one), do you replace the old visited node with the current new one?

A question is why the visited nodes don't need to be visited again, I think it may skip the node of the optimal path...

Why are you gay?

This is an excellent presentation, thank you very much. I am tempted to code it up. A question: if the graph nodes are on an xy grid, should the heuristic actually be the real word Pythagorian distance, or the distance along allowed paths?

This is important content. A related book I read was also significant. "Game Theory and the Pursuit of Algorithmic Fairness" by Jack Frostwell

19.09 minute, In G2 (13) already goal has been found. then why we need to do F(21)?

You said that if we encountered a visited node, we can ignore it if it has the higher A* score than the previous. What about when it has lower A* score? Are we supposed to draw that node again on the tree with the lower score?

A* is beautiful

this man is a hero

Great explanation, it really helped me. Just one thing, in case of a tie, why don't take the node with the lowest heuristic value instead of solving it alphabetically?

Thank you so much

Thank you for providing free educational content of such high quality! The world needs more lecturers like yourself

Hello Sir,
It was very helpful.
Want to confirm if the path cost will be f(n) for the goal node?
Thank you

wao

Please cover all topics of AI.

Where do we get the heuristics from?

Great 😍😍😍 thank you

@johnLevine Kindly share assessment problem as well with accurate heuristics.

Thank you!!

WATCHING FROM PKMKB

Amazing!!

Thanks John. This video is a lifesaver.
BTW, I've a question. Say I want to drive to the nearest city, and he wants to choose between 3 cities on a map (i.e. 3 goals states/nodes). So does this mean I have to calculate the A* score of each goal state, and then choose the smallest one? Thanks!

Think you sir but where is limited search?

7 years later, this is still best video available

Thank you very much for these efforts, greetings from Libya

Thank you. I want to know why considering only one path as the goal state. I have a burning assignment.

This is well explained thank you sir better explained than my prescribed textbook

Please anyone tell

Which algorithms is complete and optimal?

1. DFS,
2.BFS
3.A STAR
4.UCS
5.GREEDY

love u john levine u keep it real

God level explanation of the concept!!!

he has good whiteboard technique

amazing job sir!!!

this is the best video for A* algorithm

a correction, the C node at the bottom left should have its cost as 9 and not 13

Sir, I request you to make another video on the state-of-the-art bidirectional heuristic search BAE*.

calm,simple and interestig video..........
i liked it Thanks alot

Calm repetition of important facts/concepts is what makes this so helpful. It's like my Latin teacher always said: Repetitio est mater studiorum.

Still the best video available on A* search!

Man's making me wanna take an away semester here :O

You are the best

Thank you sir , for the good work

I love you bro! You are on my goat list!

7 years later, this is still best video available

Are the heuristics always given?