algorithm design techniques max min min max max figure pruned game tree >= max <= min dfigure the node marked is unimportant <= min >= max cfigure the node marked is unimportant levelwhich has called findcompmovehas already determined that it can force value of at most (recall that low values are good for the human sidesince findcompmove has tentative maximum of nothing that does will affect the result at the min level thereforec should not be evaluated this type of pruning is known as pruningit is the symmetric version of pruning when both techniques are combinedwe have - pruning