Question

(Adversarial Search/Games) To solve the following alpha-beta pruning problem: the triangles pointed up represent maximizing nodes. The triangles pointing down represent minimizing nodes. The [-∞, +∞] are place holders for the alpha-beta bookkeeping for pruning. Alpha is initialized to negative infinity (-∞). Beta is initialized to positive infinity (+ ∞). Please update alpha-beta values for each node and show your answer step by step.

-inf, +infA -inf, +inf] [-inf, +inf] B [-inf, +inf] ÀÀ A E 8 2 1 7 12 2 4 5 LO

Answer 1

step : 1

At the first step the, Max player will start first move from node A where α= -∞ and β= +∞, these value of alpha and beta passed down to node B where again α= -∞ and β= +∞, and Node B passes the same value to its C and D.

step:2

3* Mar beni Min D in C8,2 2 7 2

step:3

Mar B A mary2) Hin D a52) Min 2 12 2