Question

2. (20 points) The game tree below illustrates a position reached in the game. At each leaf node is the estimated score returned by the heuristic static evaluator. a. Fill in each blank square with the proper mini-max search value. b. Process the tree left-to-right. Which branches in (A) - (J) can be pruned by alpha- beta pruning? (Choose three branches from (A) – (J))

          2. (20 points) The game tree below illustrates a position reached in the game. At each leaf
node is the estimated score returned by the heuristic static evaluator.
a. Fill in each blank square with the proper mini-max search value.
b. Process the tree left-to-right. Which branches in (A) - (J) can be pruned by alpha-
beta pruning? (Choose three branches from (A) – (J))

2. (20 points) The game tree below illustrates a position reached in the game. At each leaf
node is the estimated score returned by the heuristic static evaluator.
a. Fill in each blank square with the proper mini-max search value.
b. Process the tree left-to-right. Which branches in (A) - (J) can be pruned by alpha-
beta pruning? (Choose three branches from (A) – (J))

Added by Denise A.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Florencia Cuzmar

Step 1

These are the scores returned by the heuristic static evaluator. Show more…

Show all steps

Thanks for your feedback!

2.(20 points) The game tree below illustrates a position reached in the game.At each leaf node is the estimated score returned by the heuristic static evaluator. a. Fill in each blank square with the proper mini-max search value b. Process the tree left-to-right.Which branches in(A-J can be pruned by alpha beta pruning?(Choose three branches from (A)-(J)) (Max) (Min) (Max)