This was really helpful for me. Thank you!

How do you know the nodes are sorted like this such that the max/min knows to prune vs the other node being possibly lower on the same depth pair? (Like when 7 prunes 9 and it was swapped order)

thank you

thank you

Minute 8:26 why is he sending up 2? instead of 6 which is the highest alfa, beta is still infinity. Dont understand this, is he doing wrong?

This is madness. I dont understand a shit. Cant see what you write its a mess and you just do stuff. No explaining.

I love you

nice video,I can understand the notion now.

Excellent walk through!

this is so unnecessarily convoluted to me

Who is here for csc384?

6 hours before the exam and I'm studying now. Why am I like this

I found the steps at kzfaq.info/get/bejne/lc9dn72Ux73PoKc.html to be a lot easier to follow!

Thanks, great explanation!

This is the prime example of a poorly planned college professor teaching a concept. No one doubts how well you understand the concept but play through your videos a few times and view it from the perspective of a student. If you do, you see a bunch of jumbo of red pen scratches and you talk through it like you are talking to yourself, instead of to an audience. People pay tens and sometimes hundreds of thousands of dollars for a shitty product (college) but they had to because that's one of the only defined safe path in life (get a degree, get a job). Be a reach teacher, have some care, plan well, present with audiences in mind is the least you can do.

Thanks. Helps lots

This video helped me understand pruning better thank you! Those of you complaining abt how messy it is, draw it yourself as he goes along.

A little bit messy But still 100 times better than my University's AI lecturer My understandeing: When a maximizer is going to look at other children, check if it already has a value that is greater than the best minimizer value along its way to root, you can stop it because the only thing it can do is to make this value more than the current value, however the current value is already greater than the best minimizer value, so the upper minimizer will discard this node anyways. Same thing to a minimizer, if it discovers its value is already smaller than the best maximizer value, you can stop it from expanding, because the only thing it can do is to keep lowering that value and it will be discarded later.

5 rewatches later Its making sense

would appreaciate it if the pen explanation was more clear

You sir, are a GOD

You should scribble more on your next video

Great video, really helped! (I'm a junior majoring in AI and Robotics)

This SAVED me on my AI midterm, thank you!

very confusing and messy lecture. better go for another. totally time waste

Only this is clear and accurate tutorial i have found on the internet..today is my AI exam..thanks a lot to you.

KZfaq ALEMİNDE GÖRDÜĞÜM EN İYİ ANLATIM AMK (alfa beta budama konusunda)

So alpha beta pruning I've found is not explained well by ANYONE individually. I tried geeksforgeeks and hackerearth. I sort of grokked the logic, but then I realized something was missing. So, I came here. The idea that alpha and beta get passed down and up were actually huge, what helps is that alpha goes updated exclusively with maximizers. Beta gets updated exclusively with minimizers. If alpha is greater than beta, you prune the remaining trees if there are still unexplored trees.

9:07 going to be even worse for the minimizer. Because minimizer will keep the value <= 2, and it cannot be larger than two.

What kind of shitty drawing is this man? So many things in one paper I can't understand anything... was it to fucking hard to erase or use another color??

are these slides available online

Honestly, there are much better ways to explain this. The whole infinity and -infinity adds unnecessary confusion to really just mean "we don't know what it could be yet"

THANK YOU SO MUCH

I find it interesting that the questions you're being asked during the lecture are very simple and barely related to the slides/algorithms, makes me wonder if the students actually understand anything you're explaining.

Hi, what if the first node is negative value? For example, if it is -5?

really helpful, thx

Very good explanation. Thank you :)

He lost me at the first diagram.

could you BE messier than this?! Awful!

it makes sense, but classifying the variable as internal structure of a node would've simplified your explanation greatly, and explaining that there appears to be two forms of pruning, local pruning and greater pruning, local where the local scope of an object is taken into account, in the first instance of the prune shown in this video; and the second where the tactical decision to circumvent this option was taken because no matter what option the maximizer presented to the minimizer the minimizer would've taken the value 2 or lower; as thats where it seems you confused alot of people. note i'm not stating there are different prunes, they use the same strategy just the reasoning behind the prune is different which i've represented with different names.

I found this very helpful especially once the values of alpha and beta weren't just infinity and -infinity! I kept pausing the video and working through a couple steps then playing the video to see if I did them right, which really helped me grasp when you change the values of alpha and beta. Great video although it did take me a couple watches to fully get it!

Awesome!

What happen in Manhattan (repeat it 10 times rapidly) !!!

VERY GOOD VIDEO!

13:39. It can't be pruned because what happens if that 2 was a 7. When it gets to the minimizer, a 7 is lower than the 8. Therefore it wins, when it gets to the root, the 7 is greater than the 6 therefore the 7 wins. Thus it can't be pruned.

Talking too fast for me. Have to watch it more than once.

So many people studying AI

Perfect!

Ok not knocking the professor, but seriously, this was quite unclear and then more unclear, and then just muddy. For the best explanation check out John Levine's video: kzfaq.info/get/bejne/sNZjibCWlbDUlmw.html - he explains the minmax algorithm - he then explains the pruning algorithm. - it is simple - it is not messy - it is concise and not rushed.

this makes a lot of sense if you've already seen this like at least a dozen times. if you're new, don't even waste time watching this