Solution

The correct answer is Option 4

Explanation:

• Value of Alpha and Beta will be passed to the nodes down below (Child nodes) in forward.
• Alpha–beta pruning can be applied to trees of any depth and it is possible to prune entire subtree rather than leaves.
• In backward movement in the tree, only node values will be passed on
• to the upper node as against Alpha and Beta values in the top to down
• Value of Alpha only will be updated in tree level assigned for
• Value of Beta only will be updated in tree level assigned for
• The best way to arrive at a good ordering is to start from the shallowest node and check the best nodes first 
• Alpha: At each point along the Maximizer path, Alpha is the best option or the highest value . –∞ is the initial value for alpha.
• Beta: At every point along the Minimizer route beta is initially set to +∞.
• The condition for Alpha-beta Pruning is α >= β