CS507 VU Assignment No 2 Spring 2012 Solution

Q01. Simulate the Minimax procedure with Alpha Beta Pruning algorithm on the
following search tree and find the Max value.

The Max value will beĀ 40

Q02. How would you re-order the nodes in order to get maximal pruning when using the
alpha-beta algorithm for the given tree? Feel free to use the figure to show the reordering.

DOWNLOAD SOLUTION HERE
loading...