Question: Problem 1:Games (50 points) For your reference in working this problem, pseudo code for the standard version of minimax with alpha beta is given on

Problem 1:Games (50 points) For your reference inProblem 1:Games (50 points) For your reference in

Problem 1:Games (50 points) For your reference in working this problem, pseudo code for the standard version of minimax with alpha beta is given on the tear off sheet at the end. Part A: Working with a maximally pruned tree (25 points) For the following min-max tree, cross out those leaf nodes for which alpha-beta search would not do static evaluations in the best case possible (minimum number of static evaluations, maximum pruning of nodes to be statically evaluated). MAX MIN b d MAX h MIN w Part A1 Now, list the leaf nodes at which alpha-beta would do static evaluations in the best case possible. Part A2 What is the final value returned by the alpha beta search in the best case possible for the given tree? Express your answer as the simplest function of the static values of the leaf nodes (eg, take n to be the static value at the leaf node labeled n). Your function may contain operations such as max and min Part A3 What constraints ensure best case possible (minimum static evaluation) for the given tree? State your constraints as inequalities on the static values of the leaf nodes. Problem 1:Games (50 points) For your reference in working this problem, pseudo code for the standard version of minimax with alpha beta is given on the tear off sheet at the end. Part A: Working with a maximally pruned tree (25 points) For the following min-max tree, cross out those leaf nodes for which alpha-beta search would not do static evaluations in the best case possible (minimum number of static evaluations, maximum pruning of nodes to be statically evaluated). MAX MIN b d MAX h MIN w Part A1 Now, list the leaf nodes at which alpha-beta would do static evaluations in the best case possible. Part A2 What is the final value returned by the alpha beta search in the best case possible for the given tree? Express your answer as the simplest function of the static values of the leaf nodes (eg, take n to be the static value at the leaf node labeled n). Your function may contain operations such as max and min Part A3 What constraints ensure best case possible (minimum static evaluation) for the given tree? State your constraints as inequalities on the static values of the leaf nodes

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!