Absolute legend. This dude has literally been more helpfull than I could ever imagine! Insane work!
@mostafakarimi1733
5 жыл бұрын
One of the best explanation of A* algorithm I've ever seen, Thank you Sir and I hope you create more videos about AI
@terrycamerlengo5492
3 жыл бұрын
This channel with John Levine is awesome. What a great lecturer! Great channel! Thank you!
@mishalubich7141
3 жыл бұрын
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!
@whiningmachine
2 жыл бұрын
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!
@coxixx
7 жыл бұрын
the best teacher on the web
@johnlevine2909
7 жыл бұрын
Thanks. Glad you liked it.
@abhishekravichandran6965
3 жыл бұрын
kzitem.info/rock/M-yUTYGmrNvKOCcAl21g3w 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
@iampujan
6 жыл бұрын
Loved the video. Clear and Understandable. Thanks Professor John. Looking forward for more videos.
@dennissaluaar9103
5 жыл бұрын
I am studying an introductory course in Artificial Intelligence here in Gothenburg, this short lecture made the A* very clear to me. Thank you!
@nitinneo7
4 жыл бұрын
The most coherent explanation of A* algorithm with an example. Thank you for saving our time and energy.
@zaid_marridi
6 жыл бұрын
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?!!!
@tollwutpinguin
4 ай бұрын
Thank you for providing free educational content of such high quality! The world needs more lecturers like yourself
@555to_infinity
4 жыл бұрын
Wow. Perfect lecture on A* search. Highly recommended!
@LucasofAppalachia
6 жыл бұрын
Absolutely phenomenal explanation. Thank you for this.
@lianghaoquan
4 жыл бұрын
Thank you for this great video! Love your clear explanation and your voice!
@husseinsylla4850
Жыл бұрын
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.
@tashijawed5472
Жыл бұрын
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
5 ай бұрын
But if the heuristic was not admissible this would not be the case right?
@KuliahInformatika
2 жыл бұрын
I love the way you explain the algorithm... easy to understand...
@cuchuoisalay9263
6 жыл бұрын
I would like to say thanks to you. Your tutorial about A* is very exciting!
@simongrome9073
Жыл бұрын
These videos are super helpful in explaining stuff I didn't get from my textbook! Thank you!
@Peter-bg1ku
2 жыл бұрын
Your explanation is amazing. Thank you!
@OsamaAlmas
6 жыл бұрын
This is amazing, You deserve more subscribers!!!
@HafizAsimNawaz
7 жыл бұрын
I love this man...... you rocked sir... hats off
@johnlevine2909
7 жыл бұрын
Thank you! Glad you found it useful.
@ShinnyxAKAvincent
6 жыл бұрын
very clear speech, awesome explanation. Thanks a lot!
@breadsteeth2562
Жыл бұрын
Love from China. Clear explanation and it helps me a lot. Thank you!
@nilsmartel2295
4 жыл бұрын
you're a most talented teacher. Thank you
@kuanghuang2773
6 жыл бұрын
very clear, very smooth, I like the teaching! thanks!
@Mousta_alpha94
5 жыл бұрын
thanks Mr john levine your explanation is excellnt
@ecekucukpehlivan9779
4 жыл бұрын
These videos are very educational and useful. Thank you so much!
@cieslak4004
5 жыл бұрын
THANK YOU! Greetings from Poland
@abdolvakilfazli2488
5 жыл бұрын
Insanely clear explanation. Hope you add more details about completeness, optimality and complexity
@TheSophiaLight
3 жыл бұрын
Clear, patient, simple. Thank you.
@sibusisondimande5209
6 жыл бұрын
Thanxxxx John. You're the best !!!!!
@nihilrocks
Жыл бұрын
Truly a godsend! Saved me 5 marks on my A levels 15mins before the exam. Couldn't have explained it better!
@SaifUlIslam-di5xv
3 жыл бұрын
It's a treat watching this as an introduction to what A* is. :D
@zijunliu7765
5 жыл бұрын
You explained way better than my professor! Thank you! Now I finally understand it.
@nethmagunathilaka41
5 жыл бұрын
Best place to learn A*. U save my day!
@saiprasad8311
5 жыл бұрын
Good example. Makes it so easy to understand admissibility issue.
@Geek-jx3gw
2 жыл бұрын
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 🙌
@baldbadger7644
3 жыл бұрын
the lecture was dilivered in a logical and clear manner, thank you so much
@shreengul6488
5 жыл бұрын
Great job sir!!! You explain things very clearly and unambiguously . No need to watch any other vedio after watching this.
@robs939
2 жыл бұрын
John the Goat! Thanks man!
@maximilianozavala8943
2 жыл бұрын
Amazing explanation, thank you so much!
@koibathekingofgames8522
Жыл бұрын
The best exemplification that I found until now, It`s worth watching.
@faox7565
6 жыл бұрын
what a clean teaching you are the best
@siddarvind6410
10 ай бұрын
A godsend. This is saving me in my CS Discrete Math class, thank you so much!
@melihekinci7758
Жыл бұрын
Very good explanation.. thank you
@Z3366N
6 жыл бұрын
Thank you for sharing 😊 it was really helpful for me.
@NinaHProductions1
6 жыл бұрын
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
@willardmakinishi6980
3 жыл бұрын
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
@bars5762
2 жыл бұрын
I'm not very good in English but your explaination is very easy to listen and understand. Thank you very much!
@AshutoshSingh-do4ts
2 жыл бұрын
Thank you sir for the explanation, it helped me a lot to understand the A* algorithm.
@Imhotep1278
6 жыл бұрын
very nice explanation and example, indeed
@aditisharma8398
5 жыл бұрын
Sir you are the best!
@kyawnyeinphyo5639
3 жыл бұрын
Sir, thank you for your amazing explanation
@nandudara3845
4 жыл бұрын
This is a perfect video for understanding A* algorithm
@mohammadvasegh1754
4 жыл бұрын
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.
@OzDavid
7 жыл бұрын
Amazing explanation. thanks sir
@PierLim
6 жыл бұрын
Thank you for this, it is extremely clear.
@AnsumanMohanty
6 жыл бұрын
Clear and concise. But could you share any resource as to why the heuristic should underestimate the cost ?
@alibrahim4686
6 жыл бұрын
You are fantastic. Please make more videos.
@piotrptak5507
6 жыл бұрын
Truly the best explanation of this algorithm we can find
@muinmohammadmozammel281
4 жыл бұрын
Short and to the point explanation. Thanks.
@dushanrathnayake5007
2 жыл бұрын
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!
@mvvkiran
4 жыл бұрын
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.
@lancelofjohn6995
2 жыл бұрын
Very good lecture,thanks!
@zhenyufan8988
6 жыл бұрын
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?
@firatyildiz66
4 жыл бұрын
Thank you for the clear explanation sir!
@ramiyousif8024
Жыл бұрын
Best video for Heuristic algorithm!! Thank you !!
@thinhnguyen3163
4 жыл бұрын
Thank your work, i'm prepairing for AI test next week. Luckily I found this
@message59
2 жыл бұрын
on point 👍🏻 super explanation thank you :)
@raiyan22
Жыл бұрын
thank you! Superb!!
@samsunny2362
6 жыл бұрын
Thank you sir for this clear explanation of A* search.
@harpreetset
7 жыл бұрын
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.
@ngusumakofu1
5 жыл бұрын
Thank you sir. Made it so much clearer
@iwayanbagus2271
5 жыл бұрын
thank you for your videos! I learnt alot
@uchungnguyen1474
6 жыл бұрын
sir hat off for your cleaning teaching!
@VaibhavSharma44
6 жыл бұрын
Thank you so much. Tutorials like these are hard to find :)
@hermosillaignacio
6 жыл бұрын
Awesome video, thank you!
@jamesthuo8763
5 жыл бұрын
Your videos are the best. Please do Greedy and other topics
@justafreak15able
6 жыл бұрын
wawo you explained it very simply and quickly.
@dapengzhang4473
5 жыл бұрын
Really like your video, it is really helpful!!!! Thank you!
@grass666
Жыл бұрын
this tutorial is sooo slay thank you king
@SiEmG
3 жыл бұрын
Hello Mr. John Levine and the rest of the people IN THE COMMENTS :). Mr. Levin thank you very much for your help. You give totally clear instructions!! :) My only question is this: is G node visited also? I think in A* goal state is also added in the visited list, right?
@alfianabdulhalin1873
25 күн бұрын
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!
@rashidafoodcornervlog654
3 жыл бұрын
Brilliant man you should make more videos
@mobeenahmad4711
6 жыл бұрын
thank you sir it was so clear and concise plz make more tutorials.
@MuhammadUsman-ry6tp
5 жыл бұрын
One of the best teacher i ever seen
@rishabhsharma5645
5 жыл бұрын
Bravo! Awesome video
@CARELESSuwu
6 жыл бұрын
Brilliant!! Thank you sooo much! :)
@adeelali8417
2 жыл бұрын
Where do you get the initial node heuristics from or do you estimate them?
@maxharris6926
3 жыл бұрын
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?
@rehamyousef7822
2 ай бұрын
Great 😍😍😍 thank you
@paulshi2821
3 жыл бұрын
Thank you for explaining this!
@abdoudjerdi9193
Жыл бұрын
thank you so much i was really struggling to understand it but you make really clear and simple
@bamboom9184
2 жыл бұрын
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
@muhammadhabib3442
7 жыл бұрын
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.
@Greatfulone
3 жыл бұрын
Thank you so much for this video. I was looking for an explanation of A*, and I think your video just helped me fix my code and learn why I had to make the change. If I understood your comments, I should only visit a node if I either have not visited it before, or its A* score is lower from the path I am currently considering. And the A* score is a sum of how much it costs to get to a node plus the nodes heuristic value. Is that right?
Пікірлер: 327