The pruning in alpha-beta refers to stopping the exploration of the whole remaining subtree below a node *WITHOUT* seeing the nodes. It is true that when you look at F, and find it is 5, it doesn't change the
You have an accent that i find a little difficult to understand, but you explain so well i only have to watch your video once to understand alpha beta pruning, even tho i have struggled with this subject for more than a year. Thank you very much!
very well explained!!! much easier to understand without notation alpha and beta...The algorithm itself is very easy, but its detailed description is very complicated.
Thanks a lot ! The most clean version of pruning tutorial i could find online. Being a simpleton, usually too much info overwhelms me but that wasn't the case here. (Y) Concise and FAST !!! Thanks Again. :)
got a question is it normal that after weeks of not understanding am now able to understand it after only 4 minutes of video? Great, but I got the question at 3:20 the pruning was not supposed to be on p rather on J? because I think 7(o) has to be checked
Node C's maximum possible value at that point in time is 4, while Node A's minimum value is bounded by 4. So exploring O and P is pointless because if it's higher than C, C doesnt change, and if it's lower than C, it won't get passed up to A anyway.
You can't prune J until you've checked O if O, P were 1 & 2 you just screwed up your whole answer you can only prune P after you've checked O because the you'll know that J >= 7 so there is no point in finding out the actual value and you prune P
Omar Nasreldin You don't need to prune O or P. if O, P had the values 1&2 then J will take the max value which is 2 and then C will take the min value which will be 2 as well; but A will always be greater than or equal to 4 hence, that 2 will be ignored. So, there was no need to check the whole 'J' branch.
yazid nordin The video creator explained it in the comments below: "The pruning in alpha-beta refers to stopping the exploration of the whole remaining subtree below a node *WITHOUT* seeing the nodes. It is true that when you look at F, and find it is 5, it doesn't change the
if 7 was a three, it will go up to C, but then A wouldn't accept it so its useless, A accepte only numbers superior of 4, and since C reached a point where he only accept numbers inferior of 4 its useless to search it's other childs
that's true but the pruning is supposed to be at P not at J. doing since 7 is never going to be check Got the same questiom, and i think i did a mistake on the video
+TheWatisit then J will choose 2 and in turn C will choose 2. But since A already has a path that ensures a value of 4 or larger it will not accept the new lower value of 2. That is why we can prune that sub branch because if O or P is large then C will reject them and if they are small A will reject them. So either way, they will be rejected.
![[UA] NAVI vs MOUZ | BO5 | IEM Rio 2024](http://i.ytimg.com/vi/CMBYk0cbGoA/mqdefault.jpg)
Our lecturer's been trying to teach us this for weeks, and you just did it in 4 minutes - my exam grade thanks you :)
Holy... super short and concise, but super easy to understand!
Thank you!
4 minutes -> *understands*
3 hour lecture -> wtf is going on
lmao
pay attention then
Daniel Pîrvan Same.
Same.
My professor tried to teach me this for an hour. He failed. You've done it in 4 minutes. Thanks a lot :-)
I get it. Minimizer is looking for upper bounds and maximizer is looking for lower bounds. Awesome explanation!
thank you kind sir! The part where the boundries were just swaped between alpha and beta by going down really helped me to understand.
I had to watch this video 3 times, but I eventually got it. Thank you so much sir. You're a Godsend!
The pruning in alpha-beta refers to stopping the exploration of the whole remaining subtree below a node *WITHOUT* seeing the nodes.
It is true that when you look at F, and find it is 5, it doesn't change the
Simple, short and precise explanation within 4 minutes. Wonderful :) kudos professor
You have an accent that i find a little difficult to understand, but you explain so well i only have to watch your video once to understand alpha beta pruning, even tho i have struggled with this subject for more than a year. Thank you very much!
By far the best explanation I found on this. Thanks!
Thanks, the ">=" and "
Your explanation is good, but you should've been more clear on whether you're starting with ALPHA or BETA.
The way you are explaining it So simple.Thank you so much!!
superb!!! the best explanation ever! better than the book and many professors
brilliant explanation... watched tons of videos and didnt understand and u made me understand in 4 minutes
Thanks for explaining it with upper and lower bounds. Really helped me grasp it.
Just learned the algorithm in 4 minutes :) Great example, explained very well, thank you!
+Oskar Kirmis World is a village :D
very well explained!!! much easier to understand without notation alpha and beta...The algorithm itself is very easy, but its detailed description is very complicated.
α is the value of the best (i.e., highest-value) choice found so far at any choice point along the path for max
Thank you sir! You helped many people struggling for Introduction to AI...
Dammmnnn !!! That's a superb explanation ... simple terms & less ambiguity ... Thank you
The >= bound is called the alpha bound, and the
Thanks a lot ! The most clean version of pruning tutorial i could find online. Being a simpleton, usually too much info overwhelms me but that wasn't the case here. (Y) Concise and FAST !!!
Thanks Again. :)
got a question is it normal that after weeks of not understanding am now able to understand it after only 4 minutes of video?
Great, but I got the question at 3:20 the pruning was not supposed to be on p rather on J? because I think 7(o) has to be checked
Node C's maximum possible value at that point in time is 4, while Node A's minimum value is bounded by 4. So exploring O and P is pointless because if it's higher than C, C doesnt change, and if it's lower than C, it won't get passed up to A anyway.
This is the most intuitive explanation I've seen. Thanks!
i read it frm the book 23 times but understood nothing... but this is understood for the first time itself... thanks
This video will help me pass my IC Exam.
In the video we have got 2
Are the bounds x (when you write >=x or
You can't prune J until you've checked O
if O, P were 1 & 2 you just screwed up your whole answer
you can only prune P after you've checked O because the you'll know that J >= 7
so there is no point in finding out the actual value and you prune P
Omar Nasreldin You don't need to prune O or P. if O, P had the values 1&2 then J will take the max value which is 2 and then C will take the min value which will be 2 as well; but A will always be greater than or equal to 4 hence, that 2 will be ignored. So, there was no need to check the whole 'J' branch.
Hello, can't this path be followed to get the value of 4: A-C-H-N? It's also feasible, right?
Thank you soo much! I actually watched this half an hour before my semester and totally got it :)
Thanks for this short and clear video! :)
It is not explaining the actual algorithm. How values of alpha & beta are going to be updated?? How cutoffs occurs?? A big Confusion here.
I like your way of explaining this, really easy to understand
Woah, that was exceptionally well described! Thanks, for the help!
Thanks for the explanation...it perfectly hits the bullseye......finally found a good video.
Finlay understood, very nice explanation better than in book anyway....
Thank you v.much!!! Really help for my studies and exam... Very easy method!
I wanna ask..
L is pruned because its value is 8 , and D is
you should do more on artificial intelligence! Thank you, life saver at exam nights :)
Tomorrow is my AI exam😂😂 and you saved me !😂
It was so helpful but confusing at first. Thank you kind sir :)
ins't the path B to F also need to be cut? :O
Top layer is max
Second layer is min
Third layer is max
Last layer is min
nice explanation... simple and easy understand...
took me two watches.......but got it. Really great, thanks man
i just wondering why u not prune F? cause we know that B
yazid nordin
The video creator explained it in the comments below:
"The pruning in alpha-beta refers to stopping the exploration of the whole remaining subtree below a node *WITHOUT* seeing the nodes.
It is true that when you look at F, and find it is 5, it doesn't change the
+yazid nordin because the "program" doesnt know that F is > 4, it has to check before making that assumption.
Very simple explanation. Thanks!
Nice this is only question I am going to prepare for my UT. 5 mins of study :p
thanks a bunch much more helpful than the textbooks
Thank you! That was very helpful, and it was just 4 minutes long, amazing :)
loved it sir...thank you so much for this beautiful explanation
Amazing explanation. Thank you.
Thanks for the nice and easy explanation...
very nice explanation, thank you very much !
this is a really very useful vid; it really helped me.
Thx a lot.
very concise example, nice!
what about alpha and beta??
Nice explanation sir !
Nice little video!
Anyone notice the letter `i` is missing :p
Super well explained! 😎👍
Truly awesome... Thank you!
Thank you very much, sir.
didnt think much when i first glanced at the video but wow thanks! :D i get it now
How did you know that 7 wasn't a three?
if 7 was a three, it will go up to C, but then A wouldn't accept it so its useless,
A accepte only numbers superior of 4, and since C reached a point where he only accept numbers inferior of 4 its useless to search it's other childs
that's true but the pruning is supposed to be at P not at J. doing since 7 is never going to be check
Got the same questiom, and i think i did a mistake on the video
Great explanation; thank you so much!
Thanks for the explanation!
But what if O and P are 1 and 2?
+TheWatisit then J will choose 2 and in turn C will choose 2. But since A already has a path that ensures a value of 4 or larger it will not accept the new lower value of 2. That is why we can prune that sub branch because if O or P is large then C will reject them and if they are small A will reject them. So either way, they will be rejected.
Great simple tutorial. Thanks a lot!
Great video, thanks
why is it called alpha beta?
True . Thanks for nice explanation .
this only one made me understand, thanks :)
Exactly what I needed, thanks!!
last minute saver. thanks :)
Well, if you don't understand it first time, watch it 2 more times ... if still not then read comments ;)
Thanks a lot, really clear and helpful.
cool explanation
Awesome, thank you so much!
Thank you very much !!!
great job!
Thank you so much
Thank you soo much for the explanation ! :)
Thank you Sir
Pretty neat!
thanks nice explanation....
we should have alpha value as 5 why we are getting alpha value as 4 .... i guess explanation is wrong
thanks a lot that was really helpful (y)
Thank you!
its clear like water now to mee
Simple, and short video. But this one made me understand, the only one.
thank you so much man!!
Great !!
Thanks
short and nyc
1st I thought this is inaccurate
But it is working correctly
thank you. very helpful!