A* Search

Why are you gay?

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...

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?

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?

Great explanation!

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

U r a genious

amo-te mano

thank you so much i was really struggling to understand it but you make really clear and simple

best explained.

good stuff

Truly a godsend! Saved me 5 marks on my A levels 15mins before the exam. Couldn't have explained it better!

thanks so much for your help

thank you! Superb!!

u makes my challenge easy tnx my lecturer

These videos are super helpful in explaining stuff I didn't get from my textbook! Thank you!

this tutorial is sooo slay thank you king

Please, just please, don't stop teaching.

The best exemplification that I found until now, It`s worth watching.

Best video for Heuristic algorithm!! Thank you !!

Love from China. Clear explanation and it helps me a lot. Thank you!

op sir

Very good explanation.. thank you

Oooh I bet your peen is enormous tehe

Hello Sir,
Best tutorial I have covered on A* algorithms. Clear and complete, include all explanations for f(n)=g(n)+h(n) and over-estimations of theoritical heuristics. Brilliant. Thank you so much.

Beats trying to understand an Indian dude with 480p video quality, a heavy accent, and terrible mic. Good job!

Thank You. have a nice day.

how can ther multiple goal states, are you computing optimal distance to each one. If so, that wasnt mentioned. strange

teachers we need : him
teachers we get : 🤡

A Legend!

This guys unbelievably skilled with a whiteboard marker

Where do you get the initial node heuristics from or do you estimate them?

Thank you for this explanation. You have no idea how many pages and videos I had to go through before somebody explained that the heuristic indicates the estimated cost to a goal node. I had no idea why we only added the destination node's heuristic to the total (and not the other nodes' heuristics along the path), and now I know. Thanks!

did anyone else notice that the path S,D,C,G2 has a cost of (6+2+5) = 11 and not 13,
and that it implies that there's no need to expand E(13)?

What to consider when defining the heuristic values? ...or how to calculate these values? - (Normally?) the "costs" represent distances or times, what other examples have you seen?

I love the way you explain the algorithm... easy to understand...

Welldone Machan..

If only I had a teacher like this in college …

Dr. Levine,

Your teaching is amazing; thank you very much for sharing the knowledge, but can you plesae state some references for students who wants to learn more about such subjects?

Thank you, I really like your explanations, they are helping me a lot for my exam.

on point 👍🏻 super explanation thank you :)

You the best

Very good lecture,thanks!

Absolute legend. This dude has literally been more helpfull than I could ever imagine! Insane work!

Thank you for this amazing explanation! Subscribed. I hope you are doing well, sir.