Great explanation! Some important notes as well: 1) only in a Max node can update the corresponding alpha, so does Min for beta. 2) v can only be returned up to its parent 3) alpha and beta can only be passed down from its parent 4) cut the current node from the tree whenever alpha >= beta In the graph on the right whiteboard, shouldn't all the alpha, beta are initialized as -infinity and infinity, respectively? At 13:07, for the completeness of the logic flow, I think we should set the beta to be 2 in the node(v=2, alpha=8, beta= ), then because alpha(8) > beta(2), we prune the right subtree.
Every single time I see that you have uploaded a video about a topic, I lose all fear, that I'm not going to be able to understand it. This is not an exaggeration, you've helped me avoid so much confusion and desperation. Thank you so much John!
Great teacher, got a B on my AI exam with your videos about tree search algorithms 👌 explained it way better in a couple of minutes than my teacher in an hour
Wonderful video. This helped a lot! Working through the example in real time and explaining your thought process as you went really helped make this click.
the best explanation about minimax. You are a great professor. I watched a lot of videos about minimax algorithm, but only your video I understood clearly
I want to thank you sir, you have done what my teacher was unable to do, a good explanation, it took me three days to understand this, and finally I understood thanks to this video
Wow, this lecture helps me understand the alpha-beta algorithm, the pseudo code is very helpful to understand. Quite intuitive. Where is the link for the assignment?
Watched it in approximately 9 minutes (X1.5 speed) and this has been the most precise and to-the-point explanation I have watched so far and believe me I have watched many. Thank you sir
Thank you sir! I was wondering if there is a formula that can calculate the maximum number of nodes that can be pruned in a tree with a depth of d and a branching factor of b.
The best explanation of alpha beta pruning. "If the value is greater than beta that means min is going to prefer the branch that lead to beta." That line made it click for me.
You are a great lecturer, not many people can do this.
Thanks! :)
Great explanation! Some important notes as well:
1) only in a Max node can update the corresponding alpha, so does Min for beta.
2) v can only be returned up to its parent
3) alpha and beta can only be passed down from its parent
4) cut the current node from the tree whenever alpha >= beta
In the graph on the right whiteboard, shouldn't all the alpha, beta are initialized as -infinity and infinity, respectively?
At 13:07, for the completeness of the logic flow, I think we should set the beta to be 2 in the node(v=2, alpha=8, beta= ), then because alpha(8) > beta(2), we prune the right subtree.
all solid things to point out, thanks
It works like a charm, Thanks!
Yeah, this algorithm is total shit
beta would never assigned the value of two; the function would return before that variable assignment.
Thanks this helped me so much, you have no idea
Excellent explanation! The video is clear, concise, and precise. We want more videos from you. Please teach us more about AI.
Just wanted to thank you for your great videos! Watching them pre-exam to refresh and they're all very clear and informative
THANK YOU SIR! I finally know alpha beta pruning!!! Your explanation was crystal clear. If you taught my AI course, I would never ditch class!!
This definitely has to be the most thorough explanation I found on the topic. Thank you! :D
Every single time I see that you have uploaded a video about a topic, I lose all fear, that I'm not going to be able to understand it. This is not an exaggeration, you've helped me avoid so much confusion and desperation. Thank you so much John!
Great teacher, got a B on my AI exam with your videos about tree search algorithms 👌 explained it way better in a couple of minutes than my teacher in an hour
Great work! Well done
Great explanation! I already knew what steps to take, but it wasn't really clear why I should take those steps. It is clear to me now.
it's just amazing. all your videos are the definition of crystal clear explanation. perfect. I wish you'll do more videos
Wonderful video. This helped a lot! Working through the example in real time and explaining your thought process as you went really helped make this click.
As a self-learner, this video is by far the best explanation I've ever seen. Clean, concise, and to the point.
One of the best video on youtube to understand Alpha Beta pruning.
Want more video like this to get more understanding of AI.
5 year later and still best video on alpha-beta pruning. Thank you sir.
Thanks for making me feel old! Very glad it's useful 😀
the best explanation about minimax. You are a great professor. I watched a lot of videos about minimax algorithm, but only your video I understood clearly
Your videos are so concise and helpful. They're the only thing keeping my grade decent in my Intelligent Systems class.
Glad you like them!
Respect to you sir. You explained it so well! I'm very grateful!
He saved my exam. Thnxx sir for such a great explanation.
He is god. He explained everything in just 13 minutes. I wish if I came across this video earlier it could have saved my time. Great teacher!!
Nice lesson, Biblo. The great eye watching you is pleased.
Awesome!! Seen most of your videos(Loved A* video too) and I must say that this topic was a bit tricky till I saw this ! You make it sound so simple
One of the best explanation, Thank you John Levine.
This is the best video about this topic
Fantastic explanation. No one on TH-cam has ever explained this algorithm so nicely using it's pseudo code . Very nice Sir, Respect
Your videos help me so much with my course, thanks!
Thanks. That was my nth video on that topic and this time it clicked. Thanks for taking the time to go through it so deliberately. :)
You're very welcome!
Can you do a video on nonlinear planning with Goal Stack...
Thank you Sir, after checking many videos on the same topic, your lecture makes me understand the topic.
I want to thank you sir,
you have done what my teacher was unable to do, a good explanation,
it took me three days to understand this, and finally I understood thanks to this video
This is the best video I have seen which explains the algorithm along with the graph.
this is amazingly helpful for me! thank you sir for this explanation!
Thank you, sir. You are a great teacher!
Really good!! Thanks for taking the time to explain it properly.
Brilliant explanation. Just what I needed. Thank you.
This is so helpful!! Thank you so much!
an excellent teacher , thank's a lot. we'r waiting for more courses about AI :) Good luck
Thank you. I've seen many videos and could not understand until I saw this video. Many thanks for your clear explanation!!
thank you for the video, it really helped me a lot doing my exam study!!
Wow, this lecture helps me understand the alpha-beta algorithm, the pseudo code is very helpful to understand. Quite intuitive. Where is the link for the assignment?
Watching this once saves me so much time that might've gone into reading through a textbook section on this particular algorithm
Don't expect to instantly understand this topic, but your video did it. Thanks. :D
Watched it in approximately 9 minutes (X1.5 speed) and this has been the most precise and to-the-point explanation I have watched so far and believe me I have watched many. Thank you sir
Thank you very very much! It takes a long time for me to understand the alpha-beta pruning .Luckly ,I find this vedio.
Damn, you are good. Thanks for helping
Great presentation of work. would it be possible to link the supplementary material associated with this lecture?
Thank You so much sir!
God Bless you!
Thank You . You're an amazing teacher .
Thanks Shivam! Glad you found it useful.
I have to admit you are the only one who could explain and impart knowledge to even the dumbest person like me. You are the great great teacher.
Best video I've seen on the subject
Thank you for this amazing video and explaination, not many have the ability to do this 🌸🖤
Great video, great explanatiom!
very good Explanation Sir! :)
Amazing videos! Thank you!
Thank you sir! I was wondering if there is a formula that can calculate the maximum number of nodes that can be pruned in a tree with a depth of d and a branching factor of b.
OMG! Very very clear! I came from CS188 step by step.
thank you so much for the lecture.
Great explanation 👌
Thank you so much! You're the best!!
Goated Explanation Sir!
Great explanation!
The best explanation of alpha beta pruning. "If the value is greater than beta that means min is going to prefer the branch that lead to beta." That line made it click for me.
Very clear explanation, Thank you
this video was so helpful.
thank you.
The only explanation that made sense to me!
Thank you!!! :)
Thank you so much for your video. It's really clear.
Thank you so much!
Please make a video on Negamax as well, would be perfect if includes Transposition in the algorithm either. And thanks for the lesson, thank you.
this is life-saving sir thanks a lot ^-^
bunch of thanks (y)
This is amazing. Thanks!
loved the way you explaine
Awesome explanation sir thanks from india
Thanks a lot, you made my day !
Great Explanation! Thanks alot.
it is a really nice explanation. thank u sir.
Sir, would you mind making a series video for Artificial Intelligence... It will be more helpful...
Good work right there!!!
thank you, Excellent explanation
Thanks teacher...I watch your videos in Azerbaijan✨
thanks man, you gave me a great favor
great explanation!!! Thank you!!!
great explaining prof
Awesome Sir, @respect
Best explanation by far
Thank you Dr
Awesome explanation. Upvote. Please make videos explain, all alogrithms Thanks!
this mans single handedly getting me through AI
great explanation!! thanks a lot
Thank you so much sir. !!!!
Thank you!
THANK YOU SIR, you saved my exam
Awesome video!
Again, superb teaching. Thank you!
Thanks!
Sirrr love your vids
Very good video. I will now attempt to code my own tic-tac-toe solver :)
Awesome, very clear
Thank you! Finally clicked after watching this video.
Great! Really glad it was useful.
thanks...have enjoyed the video
That was really helpful, Thanks !!!!
Thanks Basma! Glad you found it useful.
Thanks. your explain is quit clear😊
bsdk english to theek se bol le 6th pass ma ki chut