GAME TREE

4. [1 point] In the partial game tree below, maximizing nodes are denoted by ; minimizing nodes by ; and nodes represent positions with static values (as you can see, for this tree not all statically evaluated positions are at the same level.) Crossed-out edges indicate branches that are pruned by the alpha-beta algorithm, and therefore have no effect on the root value. Fill in values for the unpruned nodes (, , and ) that result in exactly the indicated subtrees being pruned, and no others (you need not fill in values for any pruned subtrees). Use only values in the range 09, inclusive (values may be used as often as desired.)

** All leaf values are in square boxes. i.e. 5, 10, 3, -15, 8, 6, 9, 8, 6, 5, 0, -5, -9, 14 - are ALL in boxes.

8 6 -4 5 15 86 3 8 6 -4 5 15 86 3