7 years later, this is still best video available

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

One of the best explanation of A* algorithm I've ever seen, Thank you Sir and I hope you create more videos about AI

This channel with John Levine is awesome. What a great lecturer! Great channel! Thank you!

The most coherent explanation of A* algorithm with an example. Thank you for saving our time and energy.

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!

I am studying an introductory course in Artificial Intelligence here in Gothenburg, this short lecture made the A* very clear to me. Thank you!

Best A* tutorial for run-through! Others jump around (computerphile) too much, and its not easy to get a grasp of how we can run this algorithm by hand and how it actually works (abstracting away all the data structures). Thank you so much!

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

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.

Thank you for this simple and great explanation... You're simply the best at this. Clean, clear, easy and very informative What else could someone ask for?!!!

Loved the video. Clear and Understandable. Thanks Professor John. Looking forward for more videos.

This is amazing, You deserve more subscribers!!!

Absolutely phenomenal explanation. Thank you for this.

Thank you for this great video! Love your clear explanation and your voice!

Wow. Perfect lecture on A* search. Highly recommended!

I would like to say thanks to you. Your tutorial about A* is very exciting!

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

the best teacher on the web

@johnlevine2909

7 жыл бұрын

Thanks. Glad you liked it.

@abhishekravichandran6965

3 жыл бұрын

kzread.info/dron/M-yUTYGmrNvKOCcAl21g3w.html she is the best bruh

@runneypo

3 жыл бұрын

@@abhishekravichandran6965 she has no video on a star though

@vakiljay8686

3 жыл бұрын

@@abhishekravichandran6965 S I M P

@heer1359

3 жыл бұрын

@@abhishekravichandran6965 S I M P

you're a most talented teacher. Thank you

Your explanation is amazing. Thank you!

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

I love this man...... you rocked sir... hats off

@johnlevine2909

7 жыл бұрын

Thank you! Glad you found it useful.

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

It's a treat watching this as an introduction to what A* is. :D

You explained way better than my professor! Thank you! Now I finally understand it.

Great Explanation, as always. Just want to add one thing. at 9:43 When we reached node G2 with a cost of 13, we will stop the algorithm and won't go further with "E" node. Why? because it uses Priority Queue, the algorithm will stop once it finds a Goal node with a cost "less than or equal" to costs of other nodes. And it makes sense!! because once you reached G2 with a cost of 13, even if you have another node with the same cost, there's no point in checking it because it will only add to the cost.

@peterlawrence3505

6 ай бұрын

But if the heuristic was not admissible this would not be the case right?

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

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

John the Goat! Thanks man!

Best place to learn A*. U save my day!

very clear, very smooth, I like the teaching! thanks!

Clear, patient, simple. Thank you.

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

this tutorial is sooo slay thank you king

Insanely clear explanation. Hope you add more details about completeness, optimality and complexity

Good example. Makes it so easy to understand admissibility issue.

This is a perfect video for understanding A* algorithm

These videos are very educational and useful. Thank you so much!

what a clean teaching you are the best

THANK YOU! Greetings from Poland

Thanxxxx John. You're the best !!!!!

very clear speech, awesome explanation. Thanks a lot!

thanks Mr john levine your explanation is excellnt

Truly the best explanation of this algorithm we can find

Great job sir!!! You explain things very clearly and unambiguously . No need to watch any other vedio after watching this.

Amazing explanation, thank you so much!

the lecture was dilivered in a logical and clear manner, thank you so much

throwback 2 years ago, you helped me to pass my exam and understand this algorithm really well

@balochx

2 жыл бұрын

How's life?

@Geek-jx3gw

2 жыл бұрын

@@balochx Amazing

@balochx

2 жыл бұрын

@@Geek-jx3gw stay amazing!

@Geek-jx3gw

2 жыл бұрын

@@balochx i didnt know what to answer but, life is not organized or as i wanted but it is better now 2 years before I was a stressed person, stressed about a lot of things including my future, grades, etc now, i am older and i changed into a better version of me i guess, less stressed, i love my struggles, i love to help people as much as i can, I’m trying my best to be good enough for me and my family so yeah life is amazing now🙌🏻

@balochx

2 жыл бұрын

@@Geek-jx3gw thank you so much for sharing. and yes, ups and downs are a part of life. no one is completely satisfied with his/her life, we just have to embrace it and strive for the good. helping people for no agenda brings out huge happiness. and it was nice knowing about your story. I love hearing common people rather than famous people who are faking everything. Stay blessed 🙌

You are the best teacher and provide the cleanest of explanations - at 5:53 the A* score for A is 17 (5 + 3 +2 + 7) instead of 20 I think?

@que_93

6 жыл бұрын

It should be 17, not 20.

@ngusumakofu1

5 жыл бұрын

Indeed it should be 17

@JackyShaw

5 жыл бұрын

I agree too.

@know_how5661

5 жыл бұрын

yup... its 17

@sussananukem7101

4 жыл бұрын

Nope... He's correct. He readded the path cost from A to B since we are revisiting A. That is: 5+3+(3)+2+7 =20

Thank you so much Mr. Levin. Trust me these things did not make any sense in the first encounter with my Lecturer with due respect to him. I have just watched the first minute and i Have decided to download the tutorial. Hopefully I will find your explanations on all the search Algorithms. God bless you and I hope to understand these things before June for my exams

in our country, today is teacher's day good sir. thank you for all of your clarification and examples that you've solved and happy teacher's day to you

@johnlevine2909

4 жыл бұрын

Thank you Mohamad! I'm really glad you find the videos useful.

Sir you are the best!

Thanks a lot! You really make it looks easier!

@johnlevine2909

7 жыл бұрын

Great - glad you found it useful.

I'm not very good in English but your explaination is very easy to listen and understand. Thank you very much!

Thank you sir for the explanation, it helped me a lot to understand the A* algorithm.

Best video for Heuristic algorithm!! Thank you !!

really insightful. I am learning AI and have been reading about agent searches for a while. This one is quite helpful. Can you also cover big O notations for time and space for these algorithms? it will help in analyzing in what environments it makes sense to apply them.

@johnlevine2909

7 жыл бұрын

Thanks. I'm planning to do a video comparing the algorithms, including the time and space requirements, in due course.

thank you for your videos! I learnt alot

Thank your work, i'm prepairing for AI test next week. Luckily I found this

One of the best teacher i ever seen

Short and to the point explanation. Thanks.

Thank you for sharing 😊 it was really helpful for me.

Good videos! Helped me a a lot, thanks!

Awesome video, thank you!

Thank you for this, it is extremely clear.

sir hat off for your cleaning teaching!

You are fantastic. Please make more videos.

this man is a hero

Sir, thank you for your amazing explanation

Thank you for explaining this!

Thank you so much. Tutorials like these are hard to find :)

Thank you so much that helped a lot :)

Amazing explanation. thanks sir

Really like your video, it is really helpful!!!! Thank you!

thank you! Superb!!

Brilliant man you should make more videos

So, two points I believe worth mentioning for the General Public's information sake: 1. The Search considered here is a GRAPH Search - NOT a Tree search. John Levine generally considers all Graph Search for all Search Algorithms - at least in the Uninformed & this A* Algs, so far 2. The REASON why the Heuristic MIGHT BE LESS THAN the Actual Cost of Reaching of a Goal is Because the Basic Heuristic considered for an A* Search is a Straight Line Distance - SLD. And we a know a PATH is NOT ALWAYS a Straight Line. How much ever Better a Heuristic you introduce, you'll never get the Actual Cost of Reaching a Goal State to be less than it. The Best Heuristic will Predict the EXACT cost of reaching a Goal State (only with ZERO Path Costs of course as A* Cost = Path Cost + Heuristic Cost) Hope this helps.

Clear and concise. But could you share any resource as to why the heuristic should underestimate the cost ?

Very good explanation.. thank you

Thank you for the clear explanation sir!

very nice explanation and example, indeed

Well, that marvelous.

Thank you sir. Made it so much clearer

thank you sir it was so clear and concise plz make more tutorials.

on point 👍🏻 super explanation thank you :)

It's a great illustration!! But can u give us a example of how to decide the estimate value from certain node to a goal node?

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

Just brilliant! Thank you so much! At 5:53 the A* score for A is 17 (5 + 3 +2 + 7) instead of 20 I think.

@johnlevine2909

2 жыл бұрын

Thank you, and well spotted!

Bravo! Awesome video

I am serious like wow loved the lecture was soooooo interesting please keep this up you will be helping alot of ppl since most teachers dont know what they are talking about

Very good lecture,thanks!

Extremely helpful , thank you

Great Tutorial, Please also Make another tutorial on the Optimality proof of A∗

@johnlevine2909

7 жыл бұрын

Many thanks, and thanks for the suggestion - I think that's a great idea.

Brilliant!! Thank you sooo much! :)

Your videos are the best. Please do Greedy and other topics

wawo you explained it very simply and quickly.

holy astar guacamole! perfect explanation!!

Thank you, I finally understand this

Thank you. I didn't skip a single second!

@johnlevine2909

7 жыл бұрын

Excellent! Glad you liked it.