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 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!
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?!!!
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.
@@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🙌🏻
@@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 🙌
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.
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
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
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.
Great Video, thank you for explaining A*. For clarification if you find a node that has been visited, but the current path's A* score is less than the cost in the visited set, would you continue on the path and update the A* score in the visited set?
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?
Dear Professor, this is such an amazing video, your way of explaining is just perfect, however i am doing a path planning for the navigation of a mobile robot in the environment, is A* the best technique to do that ? also, can you link me the litterature for this please ?
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?
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!
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!
Loved the video. Clear and Understandable. Thanks Professor John. Looking forward for more videos.
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!
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?!!!
The most coherent explanation of A* algorithm with an example. Thank you for saving our time and energy.
Absolutely phenomenal explanation. Thank you for this.
Thank you for this great video! Love your clear explanation and your voice!
Thank you for providing free educational content of such high quality! The world needs more lecturers like yourself
I am studying an introductory course in Artificial Intelligence here in Gothenburg, this short lecture made the A* very clear to me. Thank you!
Wow. Perfect lecture on A* search. Highly recommended!
I would like to say thanks to you. Your tutorial about A* is very exciting!
the best teacher on the web
Thanks. Glad you liked it.
th-cam.com/channels/M-yUTYGmrNvKOCcAl21g3w.html
she is the best bruh
@@abhishekravichandran6965 she has no video on a star though
@@abhishekravichandran6965 S I M P
@@abhishekravichandran6965 S I M P
I love this man...... you rocked sir... hats off
Thank you! Glad you found it useful.
This is amazing, You deserve more subscribers!!!
These videos are super helpful in explaining stuff I didn't get from my textbook! Thank you!
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.
Your explanation is amazing. Thank you!
I love the way you explain the algorithm... easy to understand...
Insanely clear explanation. Hope you add more details about completeness, optimality and complexity
you're a most talented teacher. Thank you
THANK YOU! Greetings from Poland
throwback 2 years ago, you helped me to pass my exam and understand this algorithm really well
How's life?
@@balochx Amazing
@@Geek-jx3gw stay amazing!
@@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🙌🏻
@@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 🙌
Best place to learn A*. U save my day!
Clear, patient, simple. Thank you.
very clear speech, awesome explanation. Thanks a lot!
Truly a godsend! Saved me 5 marks on my A levels 15mins before the exam. Couldn't have explained it better!
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.
But if the heuristic was not admissible this would not be the case right?
very clear, very smooth, I like the teaching! thanks!
These videos are very educational and useful. Thank you so much!
Love from China. Clear explanation and it helps me a lot. Thank you!
what a clean teaching you are the best
It's a treat watching this as an introduction to what A* is. :D
Great job sir!!! You explain things very clearly and unambiguously . No need to watch any other vedio after watching this.
Truly the best explanation of this algorithm we can find
Thank you for sharing 😊 it was really helpful for me.
You explained way better than my professor! Thank you! Now I finally understand it.
thanks Mr john levine your explanation is excellnt
This is a perfect video for understanding A* algorithm
A godsend. This is saving me in my CS Discrete Math class, thank you so much!
Good example. Makes it so easy to understand admissibility issue.
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
Thank you Mohamad! I'm really glad you find the videos useful.
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
Your videos are the best. Please do Greedy and other topics
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.
Thanks. I'm planning to do a video comparing the algorithms, including the time and space requirements, in due course.
John the Goat! Thanks man!
The best exemplification that I found until now, It`s worth watching.
Thank you for this, it is extremely clear.
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?
Sir you are the best!
Thank your work, i'm prepairing for AI test next week. Luckily I found this
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?
It should be 17, not 20.
Indeed it should be 17
I agree too.
yup... its 17
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
Clear and concise. But could you share any resource as to why the heuristic should underestimate the cost ?
Thanxxxx John. You're the best !!!!!
Amazing explanation. thanks sir
I'm not very good in English but your explaination is very easy to listen and understand. Thank you very much!
Bravo! Awesome video
Amazing explanation, thank you so much!
the lecture was dilivered in a logical and clear manner, thank you so much
You are fantastic. Please make more videos.
Thank you so much. Tutorials like these are hard to find :)
Brilliant!! Thank you sooo much! :)
Simply the best
Great Tutorial, Please also Make another tutorial on the Optimality proof of A∗
Many thanks, and thanks for the suggestion - I think that's a great idea.
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.
Thank you, and well spotted!
Brilliant man you should make more videos
Best video for Heuristic algorithm!! Thank you !!
very nice explanation and example, indeed
wawo you explained it very simply and quickly.
sir hat off for your cleaning teaching!
this tutorial is sooo slay thank you king
Really like your video, it is really helpful!!!! Thank you!
One of the best teacher i ever seen
thank you for your videos! I learnt alot
Perfect A* score for the teacher
Awesome video, thank you!
Great Video, thank you for explaining A*. For clarification if you find a node that has been visited, but the current path's A* score is less than the cost in the visited set, would you continue on the path and update the A* score in the visited set?
Short and to the point explanation. Thanks.
on point 👍🏻 super explanation thank you :)
Extremely helpful , thank you
Thank you sir. Made it so much clearer
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?
Well, that marvelous.
Dear Professor, this is such an amazing video, your way of explaining is just perfect, however i am doing a path planning for the navigation of a mobile robot in the environment, is A* the best technique to do that ? also, can you link me the litterature for this please ?
holy astar guacamole! perfect explanation!!
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?
Sir, thank you for your amazing explanation
Thank you for the clear explanation sir!
really useful tutorial sir gonna subscribe your channel pls do more videos on ai....
Thanks a lot! You really make it looks easier!
Great - glad you found it useful.
Thank you sir for this clear explanation of A* search.
thank you sir it was so clear and concise plz make more tutorials.
Great teacher
Very clear and professional, thank you for the lesson
iLikeKFC can you help me please
thank you! Superb!!
Good videos! Helped me a a lot, thanks!
Where do you get the initial node heuristics from or do you estimate them?
Thank you for explaining this!