6. Consider the following game tree. ДМах V Min Terminal node Notice that three terminal nodes marked a, b and c have no values (? marked). Suppose that the red circled nodes are pruned when you apply minimax search algorithm with alpha-beta pruning. Assign appropriate values to a, b, and c that will result in such a pruning. [3] b=? 5 2 a=? 6 7 5 5 c=? 8 8 -2 N

30 0

Get full Expert solution in seconds

$1.97 ONLY

Unlock Answer