Question: Suppose you have a perfect tree (all leaves at same depth) with a branching factor of 3. Assume the game is zero-sum, the top node

Suppose you have a perfect tree (all leaves at same depth) with a branching factor of 3. Assume the game is zero-sum, the top node is a maximizer and turns always alternate. Assume the tree is always searched from left to right.

(1) Give an example of a tree where over 50% of the leaves can be pruned.

(2) What is the minimum depth for which 75% of the leaves can be pruned? Describe the values of the leaves from left to right. (Hint: once you figure out the pattern to follow, you might want to write a small program.)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!