Excellent explanation! The video is clear, concise, and precise. We want more videos from you. Please teach us more about AI.
@bryanbocao49065 жыл бұрын
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.
@rampage14x135 жыл бұрын
all solid things to point out, thanks
@kingtqos15145 жыл бұрын
It works like a charm, Thanks!
@superuser86363 жыл бұрын
Yeah, this algorithm is total shit
@imnacho41272 жыл бұрын
beta would never assigned the value of two; the function would return before that variable assignment.
@kevin-lamquesnel9067 Жыл бұрын
Thanks this helped me so much, you have no idea
@RahulSam7 жыл бұрын
You are a great lecturer, not many people can do this.
@johnlevine29097 жыл бұрын
Thanks! :)
@XxBleedRainbowxX5 жыл бұрын
Just wanted to thank you for your great videos! Watching them pre-exam to refresh and they're all very clear and informative
@nilsmartel22954 жыл бұрын
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!
@jabodey6 жыл бұрын
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!!
@sagnik31056 жыл бұрын
This definitely has to be the most thorough explanation I found on the topic. Thank you! :D
@GtaRockt3 жыл бұрын
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
@johnlevine29093 жыл бұрын
Great work! Well done
@benaya64 жыл бұрын
it's just amazing. all your videos are the definition of crystal clear explanation. perfect. I wish you'll do more videos
@adamkawsara68816 жыл бұрын
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.
@pellekools64756 жыл бұрын
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.
@AdityaRaj_Purohit5 жыл бұрын
One of the best video on youtube to understand Alpha Beta pruning. Want more video like this to get more understanding of AI.
@yashvats9703 Жыл бұрын
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!!
@oshawastaken Жыл бұрын
5 year later and still best video on alpha-beta pruning. Thank you sir.
@johnlevine2909 Жыл бұрын
Thanks for making me feel old! Very glad it's useful 😀
@andrewweems94276 жыл бұрын
Your videos are so concise and helpful. They're the only thing keeping my grade decent in my Intelligent Systems class.
@johnlevine29096 жыл бұрын
Glad you like them!
@jonathancui30634 жыл бұрын
As a self-learner, this video is by far the best explanation I've ever seen. Clean, concise, and to the point.
@PauloViniciusMoreiraDutra3 жыл бұрын
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
@ManishSharma-cf3or5 жыл бұрын
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
@mesosiderite4670 Жыл бұрын
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
@syedahabali24506 жыл бұрын
Respect to you sir. You explained it so well! I'm very grateful!
@hemmahbeast5 жыл бұрын
Nice lesson, Biblo. The great eye watching you is pleased.
@cookiejar30943 ай бұрын
Your videos help me so much with my course, thanks!
@prasangsinghal2625 жыл бұрын
He saved my exam. Thnxx sir for such a great explanation.
@meharabdullah86086 жыл бұрын
Fantastic explanation. No one on KZbin has ever explained this algorithm so nicely using it's pseudo code . Very nice Sir, Respect
@TheZ0mi5 жыл бұрын
Thank you Sir, after checking many videos on the same topic, your lecture makes me understand the topic.
@Fionasfung2 жыл бұрын
This is the best video I have seen which explains the algorithm along with the graph.
@GauravYadavdv315 жыл бұрын
One of the best explanation, Thank you John Levine.
@ahlamalbimani20706 жыл бұрын
Thank you. I've seen many videos and could not understand until I saw this video. Many thanks for your clear explanation!!
@rv.96582 жыл бұрын
Watching this once saves me so much time that might've gone into reading through a textbook section on this particular algorithm
@mkamp7 жыл бұрын
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. :)
@johnlevine29097 жыл бұрын
You're very welcome!
@bharathpalla37056 жыл бұрын
Can you do a video on nonlinear planning with Goal Stack...
@fejohnson6 жыл бұрын
this is amazingly helpful for me! thank you sir for this explanation!
@nassimmehalli70435 жыл бұрын
an excellent teacher , thank's a lot. we'r waiting for more courses about AI :) Good luck
@nh16226 жыл бұрын
Really good!! Thanks for taking the time to explain it properly.
@jennachen14115 жыл бұрын
Thank you very very much! It takes a long time for me to understand the alpha-beta pruning .Luckly ,I find this vedio.
@_justinxu3 жыл бұрын
Don't expect to instantly understand this topic, but your video did it. Thanks. :D
@onecleanrun5 жыл бұрын
Brilliant explanation. Just what I needed. Thank you.
@user-xp3me9ws9c5 жыл бұрын
thank you for the video, it really helped me a lot doing my exam study!!
@dien29715 жыл бұрын
Thank you, sir. You are a great teacher!
@dadas78526 жыл бұрын
This is the best video about this topic
@user-pr6cq3rs4x Жыл бұрын
Thank you for this amazing video and explaination, not many have the ability to do this 🌸🖤
@ArushitMudgal6 жыл бұрын
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
@alexanderyau63476 жыл бұрын
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?
@dimmo156 жыл бұрын
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.
@sergiovasquez56433 жыл бұрын
Great presentation of work. would it be possible to link the supplementary material associated with this lecture?
@BeSharpInCSharp4 жыл бұрын
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.
@nicolemb0511 ай бұрын
This is so helpful!! Thank you so much!
@vinicius26996 жыл бұрын
Damn, you are good. Thanks for helping
@shivamroy17757 жыл бұрын
Thank You . You're an amazing teacher .
@johnlevine29097 жыл бұрын
Thanks Shivam! Glad you found it useful.
@johnphilipespia11673 жыл бұрын
Thank you so much! You're the best!!
@Jantol932 жыл бұрын
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.
@hangchen4 жыл бұрын
OMG! Very very clear! I came from CS188 step by step.
@sashinthat3173 Жыл бұрын
Goated Explanation Sir!
@dbnnoman55963 жыл бұрын
Thank You so much sir! God Bless you!
@xdxdxd15 жыл бұрын
Amazing videos! Thank you!
@madeline-qk3vg Жыл бұрын
this is life-saving sir thanks a lot ^-^
@shivamgarg4375 жыл бұрын
Do we always start with the root node as the maximum one?
@weidong13785 жыл бұрын
Best video I've seen on the subject
@TrangPham-kc7ft4 жыл бұрын
Thank you so much for your video. It's really clear.
@jebaanto76493 жыл бұрын
Awesome explanation sir thanks from india
@ImranAkbarUK6 жыл бұрын
very good Explanation Sir! :)
@amirbaba96772 жыл бұрын
this video was so helpful. thank you.
@SentryProductions16 жыл бұрын
Would the -2 value not be pruned as we have a deep cut off situation ? We can see that Max will be = 8? Is there point in exploring -2?
@Tash985 жыл бұрын
The only explanation that made sense to me!
@mertdusunceli51595 жыл бұрын
why does 8 get placed as alpha in the level 2 right node ?
@joaquinvanloon73416 жыл бұрын
Great video, great explanatiom!
@bangminh57127 жыл бұрын
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.
@pratyushshrivastava43624 ай бұрын
Great explanation!
@AGCrush3 жыл бұрын
Great Explanation! Thanks alot.
@linh63604 жыл бұрын
thank you so much for the lecture.
@jonesmukuta19102 жыл бұрын
Good work right there!!!
@guoshenli41932 жыл бұрын
great explanation!!! Thank you!!!
@beri41384 жыл бұрын
Very good video. I will now attempt to code my own tic-tac-toe solver :)
@lenniegames35297 жыл бұрын
Is it at all possible to see the slides you mention in the video? I've spent the past couple of days trying to figure out how to apply MiniMax with Alpha-Beta Pruning to my A-Level Chess AI, and I always seem to get bugs that shouldn't exist (I literally mean they shouldn't exist, not I don't know why they exist), Thanks
@bushrhaddad31415 жыл бұрын
Very clear explanation, Thank you
@aynurememmedova9436 Жыл бұрын
Thanks teacher...I watch your videos in Azerbaijan✨
@j_m_b_1914 Жыл бұрын
I must be missing something because the following scenario seems like a possible scenario where alpha beta pruning can discount a superior position down the road. In chess, isn't it possible to have a move sequence where moves 6 ply out may show an inferior score for white but if the line was analyzed further, we'd see that white might be able to force a mate by taking a material loss. Wouldn't alpha beta pruning possibly discount such a line by abandoning further computational depth for that line such that it would never be able to see that a temporary drop in maximization of white's score actually sets up for a win for white? I guess my question can be reduced to this: Is it possible for alpha beta pruning to discount a line that is temporarily inferior (low score) but a few moves further out we discover a forced mate? Could alpha beta pruning throw out the analysis for such lines? Also, the entire principle of the minimax algo (in my opinion) is the scoring we give specific positions based on what information has been learned about chess over the centuries. We rank certain material with specific scores and also certain positions with specific scores. If the methodology of scoring the current state of the chess game is imperfect, then the minimax algo may not always be 100% optimal in the search tree it explores based on those scores. Let me give a quick counter example to (hopefully) better illustrate my argument. In the game of chess, there is really only one ultimate score -- is there a sequence of moves from the current game position where white (or black if playing black) can force a checkmate of the opposing king. Every other analysis within the game is of no consequence if it doesn't lead to a line where the opposing king is checkmated (or if checkmating is not possible, the only other analysis of consequence is trying to draw the current game). A new chess engine called Oracle is created using hardware from thousands of years into the future. Oracle is able to analyze 100 ply within the game in a matter of microseconds. Oracle discovers a line where white sacrifices four pieces (let's say a pawn, a knight, a bishop and a rook) in order to force a mate on the opposing king approximately 20 moves out. Now in this example, wouldn't current engines stop processing this line after the first or second piece was lost because the minimax score / alpha beta pruning? The current engine might discount the sequence of moves and call the first sacrifice a blunder because it never processed this particular line deeper. I could be way off here because my knowledge of minimax with A/B pruning is incomplete -- that's why I'm throwing this out there for others with more experience. Is this a disadvantage of minimax with AB pruning?
@simha31546 жыл бұрын
This is amazing. Thanks!
@mohamedibrahimhassan2912 жыл бұрын
loved the way you explaine
@mursheduzzamanrakib2606 жыл бұрын
Sir, would you mind making a series video for Artificial Intelligence... It will be more helpful...
@simoneditzzz Жыл бұрын
thanks man, you gave me a great favor
@AntonAtef Жыл бұрын
Great explanation 👌
@shehrozkhan95632 жыл бұрын
Sirrr love your vids
@hoomanjafari46335 жыл бұрын
Thanks a lot, you made my day !
@nmt8005 жыл бұрын
Awesome explanation. Upvote. Please make videos explain, all alogrithms Thanks!
@dgglovesbb9 ай бұрын
Thank you so much!
@ammarzorig27714 жыл бұрын
Thank you Dr
@WickedChild956 жыл бұрын
Awesome video!
@dijkstra59525 жыл бұрын
Is it just me or is he the actor who played Benjamin Linus from LOST (Michael Emerson)? He both looks and speaks exactly like Ben.
@tega27547 жыл бұрын
Thank you!!! :)
@blackfromabove93833 жыл бұрын
Many thanks for explanation!
@Noah-3574 ай бұрын
What would be a real life example ?. For example, when robo vacuum is trying to clean a house, what would be the example of pruning here ?. Is pruning happening when robo vacuum for example when it says task finish although it's not like skipping task because there are an obstacles blocking its way?
@shantanulokhande37309 ай бұрын
Thank you so much sir. !!!!
@matteomastandrea5680 Жыл бұрын
this mans single handedly getting me through AI
@yashin20685 жыл бұрын
it is a really nice explanation. thank u sir.
@ahsanshahid116 жыл бұрын
bunch of thanks (y)
@abdellahi.heiballa5 жыл бұрын
great explaining prof
@mohamedthajmeel9715 Жыл бұрын
can min come at the top and be followed by max?
@kasunigamage35295 жыл бұрын
great explanation!! thanks a lot
@laibaidrees7933 Жыл бұрын
Kindly sir make videos on graph and tree searching algorithms i.e. by bfs,dfs,uniform cost search in python.
@user-si3bw5yb7p9 ай бұрын
Thanks. your explain is quit clear😊
@178_AMANKUMARSINHA7 ай бұрын
bsdk english to theek se bol le 6th pass ma ki chut