Q51,paper 3,J 12. The strategy used to reduce the number of tree branches and the number of static evaluations applied in case of a game tree is

Options
(A) Minmax strategy
(B) Alpha-beta pruning strategy
(C) Constraint satisfaction strategy
(D) Static max strategy
Answer(B)
Explanation
Alpha–beta pruning is a search algorithm that seeks to decrease the number of nodes that are evaluated by the minimax algorithm in its search tree. It is an adversarial search algorithm used commonly for machine playing of two-player games like Tic-tac-toe, Chess, Go, etc. It stops completely evaluating a move when at least one of the possibility has been found that proves the move to be worse than a previously examined move. Such moves need not be evaluated further. When applied to a standard minimax tree, it returns the same move as minimax would, but prunes away branches that cannot take to the final decision.