Adversarial search is a productive representation of any strategic game e.g. Min-Max. But in some cases to understand the strategy we need to prune the search space tree to have a more clear picture and reduce complexity of game agent. Consider the following Min-Max tree a. Apply Depth-First search to Find C b. Prune the tree using alpha beta pruning algorithm. c. Apply Depth-First search to Find C again, and define the advantages you get by applying pruning algorithm in part 2.

Sax Sfax 3 59 1 7 5 sede