Answer Happy

4. We are given the following game tree. : Q90% Q a. What is the total number of terminal nodes (denoted by squares at bottom)? Your answer should be an integer. b. Suppose you use alpha-beta pruning to prune branches from game tree. What is the maximum total number of terminal nodes whose value is never explored because an immediate or upstream branch is pruned in one single set of assignments for the terminal nodes? C. Which of the following algorithms is always guaranteed to provide the optimal solution for the corresponding problems they solve? We define "corresponding problem" as one of the following: uninformed/informed search, CSPs, MDPs, game trees, reinforcement learning. a) DFS b) Greedy search c) Hill climbing d) Simulated annealing e) Policy extracted from policy iteration f) Policy extracted from value iteration g) Minimax search with a-ß pruning (assuming both players are playing optimally) h) None of the above