LM21-Alpha - Beta Pruning &Stochastic Games

5 flashcards · Computer Science · by Ramya Santhi Ramachandran

1. Which values are independant in minimax search algorithm?

   Pruned leaves x and y

2. To which depth does the alpha-beta pruning can be applied?

   Any depth

3. Which value is assigned to alpha and beta in the alpha-beta pruning?

   Both Alpha = max & Beta = min

4. Where does the values of alpha-beta search get updated?

   Along the path of search

5. How the effectiveness of the alpha-beta pruning gets increased?

   Depends on the nodes