a. In the game search tree of Figure 2, indicate what nodes will be pruned using

Question

a. In the game search tree of Figure 2, indicate what nodes will be pruned using alpha-beta 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. This question is also on the game search tree of Figure 2. 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, alpha-beta search expands nodes in a left-to-right order, and that the MAX player plays first.

Explanation / Answer

a. Solution is as below:

b: For part b we can take the consider the same solution explained above and if we have extra knowledge that maximum utility can be 10 then after traversing the left side nodes of node A we got value 10 so we will not try to find the other maximum value in right child of node A and hence the complete right child tree of node A will pruned.

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.