Consider the following 3-ply (depth 3) adversarial search tree, with leaf node terminal evaluation (utility) shown: NODE A - children: B,C,D NODE B - children: E,F,G NODE C - children: H, I NODE D - children: J,K NODE E - children: (2 child nodes) evaluated: 7,6 NODE F -children: (2 child nodes) evaluated: 8,5 NODE Gchildren: (2 child nodes) evaluated: 2,3 NODE H - children: (2 child nodes) evaluated: 0,-2 NODE I - children: (2 child nodes) evaluated: 6,2 NODE J - children: (2 child nodes) evaluated: 5, 8 NODE K-children: (2 child nodes) evaluated: 9,2 Draw the game tree showing the backed up minimax values, assuming alpha-beta pruning (show the cuts), and indicate which move that the algorithm determines that the computer should play. How many leaf node evaluations were saved by using alpha-beta pruning? a. b. Redraw the above tree assuming that a heuristic had managed to SORT the moves perfectly at EVERY ply (depth level) [you should remember that perfect sorting is never feasible, but we are doing it here to observe how sorting in general can improve performance]. Retain the given letters A-K to label the same nodes, so that your re- ordering is clear. Then, re-do the minimax analysis and show the alpha-beta cuts that would result. How many leaf node evaluations were saved because of the ordering? Consider the following 3-ply (depth 3) adversarial search tree, with leaf node terminal evaluation (utility) shown: NODE A - children: B,C,D NODE B - children: E,F,G NODE C - children: H, I NODE D - children: J,K NODE E - children: (2 child nodes) evaluated: 7,6 NODE F -children: (2 child nodes) evaluated: 8,5 NODE Gchildren: (2 child nodes) evaluated: 2,3 NODE H - children: (2 child nodes) evaluated: 0,-2 NODE I - children: (2 child nodes) evaluated: 6,2 NODE J - children: (2 child nodes) evaluated: 5, 8 NODE K-children: (2 child nodes) evaluated: 9,2 Draw the game tree showing the backed up minimax values, assuming alpha-beta pruning (show the cuts), and indicate which move that the algorithm determines that the computer should play. How many leaf node evaluations were saved by using alpha-beta pruning? a. b. Redraw the above tree assuming that a heuristic had managed to SORT the moves perfectly at EVERY ply (depth level) [you should remember that perfect sorting is never feasible, but we are doing it here to observe how sorting in general can improve performance]. Retain the given letters A-K to label the same nodes, so that your re- ordering is clear. Then, re-do the minimax analysis and show the alpha-beta cuts that would result. How many leaf node evaluations were saved because of the ordering
