Question: in the Minimax algorithm, why when we find alpha, we cut every edge after the edge leads to a value less than or equal to

 in the Minimax algorithm, why when we find alpha, we cut

in the Minimax algorithm, why when we find alpha, we cut every edge after the edge leads to a value less than or equal to alpha in the max level for a certain sub-tree? Use the editor to format your

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!