1. Given the following tree: B max A D 13 E 9 F G H 4...

   

Transcribed Image Text:

1. Given the following tree: B max A D 13 E 9 F G H 4 I J 5 K 7 L 8 N 7 a. Apply minimax algorithm on the above tree showing sequence of moves b. Perform a left to right alpha-beta prune on the above tree and show where to cut C. Perform a right to left alpha-beta prune on the above tree 1. Given the following tree: B max A D 13 E 9 F G H 4 I J 5 K 7 L 8 N 7 a. Apply minimax algorithm on the above tree showing sequence of moves b. Perform a left to right alpha-beta prune on the above tree and show where to cut C. Perform a right to left alpha-beta prune on the above tree