Unformatted text preview: leaf nodes at which alpha-beta would do static evaluations in the best case possible. 2 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 (e.g. 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. Part A4
Suppose your static evaluation function, S(node), is modified as follows:
S'(node) = 42 x S(node) + 1000. (If S(node) = 1, S'(node) = 1042)
Would your answer for Part A1 be the same for all possible S(node) values? Yes No Yes No Suppose your function were
S'(node) = - 42 x S(node) + 1000.
Would your answer for Part A1 be the same for all possible S(node) values? 3 Explain your reasoning in less than 4 meaningful...
View Full Document
- Fall '10
- Artificial Intelligence