1. α-β pruning a) In the game search tree of Figure 2, indicate what nodes will be pruned using α-β search, and what the estimated utility values are for the rest of the nodes. Assume that, when given a choice, alpha-beta search expands nodes in a left-to-right order. Also, assume the MAX player plays first. b) Suppose we are given some additional knowledge about the game: the maximum utility value is 10, i.e., it is not mathematically possible for the MAX player to get an outcome greater than 10. How can this knowledge be used to further improve the efficiency of alpha-beta search? Indicate the nodes that will be pruned using this improvement. Again, assume that, when given a choice, α-β search expands nodes in a left-to-right order, and that the MAX player plays first.
1. α-β pruning
a) In the game search tree of Figure 2, indicate what nodes will be pruned using α-β
search, and what the estimated utility values are for the rest of the nodes. Assume that, when
given a choice, alpha-beta search expands nodes in a left-to-right order. Also, assume the MAX
player plays first.
b) Suppose we are given some additional knowledge about the game: the maximum utility value is 10, i.e., it is not
mathematically possible for the MAX player to get an outcome greater than 10. How can this
knowledge be used to further improve the efficiency of alpha-beta search? Indicate the nodes
that will be pruned using this improvement. Again, assume that, when given a choice, α-β
search expands nodes in a left-to-right order, and that the MAX player plays first.
According to the information given:-
We have to solve on the basis of instruction mentioned.
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images
