You are playing the dots and boxes game on a 3x3 grid shown below. Each player...

 

Transcribed Image Text:

You are playing the dots and boxes game on a 3x3 grid shown below. Each player must draw an edge connecting two dots, if it doesn't already exist. The player who draws the 4th line that completes a small square receives a +1 score. The overall square surrounding the whole game does not count. After all 4 missing edges have been completed, the utilities will lay between +3 (first/max player completed all 3 boxes) and -3 (second/min player completed all 3 boxes). A C It's the max player's turn. a) Draw a full minimax search tree for this game using the order A(leftmost) to D(rightmost) to organize your diagram. b) Apply the alpha-beta pruning method using the same order of node expansion and show the alpha-beta values for all nodes. Is there any advantage to using alpha-beta pruning with this ordering? Write out one of the orderings that leads to the most pruning. If you cannot find one, explain why not. You are playing the dots and boxes game on a 3x3 grid shown below. Each player must draw an edge connecting two dots, if it doesn't already exist. The player who draws the 4th line that completes a small square receives a +1 score. The overall square surrounding the whole game does not count. After all 4 missing edges have been completed, the utilities will lay between +3 (first/max player completed all 3 boxes) and -3 (second/min player completed all 3 boxes). A C It's the max player's turn. a) Draw a full minimax search tree for this game using the order A(leftmost) to D(rightmost) to organize your diagram. b) Apply the alpha-beta pruning method using the same order of node expansion and show the alpha-beta values for all nodes. Is there any advantage to using alpha-beta pruning with this ordering? Write out one of the orderings that leads to the most pruning. If you cannot find one, explain why not.