1. Consider the following 3-level game tree with e-values on the leaves as shown: A+ B- E+ F+ G+ H+ J+ A L- M- N- O- P- Q- R- S- T- U- V- W- X- Y- 7 6 8 5 2 3 0 -2 6 2 5 8 9 2 a) Using a minimax evaluation, which next move should the first player (+) choose? b) If an alpha-beta search (using a DFS with a left-to-right expansion of successors) is used instead, which nodes would not have to be expanded/evaluated? c) If an optimal alpha-beta search (DFS with an optimal expansion of successors) is used instead, which nodes would not have to be expanded/evaluated?

1. Consider the following 3-level game tree with e-values on the leaves as shown: A+ B- E+ F+ G+ H+ J+ A L- M- N- O- P- Q- R- S- T- U- V- W- X- Y- 7 6 8 5 2 3 0 -2 6 2 5 8 9 2 a) Using a minimax evaluation, which next move should the first player (+) choose? b) If an alpha-beta search (using a DFS with a left-to-right expansion of successors) is used instead, which nodes would not have to be expanded/evaluated? c) If an optimal alpha-beta search (DFS with an optimal expansion of successors) is used instead, which nodes would not have to be expanded/evaluated?

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

You are given the following game tree. The top level is a maximizing level. A B D E F G 10 12 13 16 13 10 17 6 а. Give the values calculated by minimax for all the nodes labeled by letters in the tree. Do not use alpha-beta pruning. For example, the answer for node D is 12 so you will write D:12 and do the same for all the other nodes. b. Indicate which labeled nodes of the tree will be pruned by alpha-beta pruning.
Problem 6 Consider a data set that contains 4 Boolean attributes A, B, C, and D, and a Boolean class y. For the Boolean expression below (between the class the rest of the attributes), it is possible to construct a smaller decision tree that perfectly classifies the data without generating the complete tree (i.e., the number of leave nodes is less than 16). Then, draw such a tree. and y = A ^ BA C ^ D
Create optimal binary search trees by applying the dynamic programming approach to the following data. Draw the resulting tree. Data A B G possibility 4 1. 5 2 1. Data 1 possibility 0.01 0.02 0.04 0.08.0 0.16 0.69 3. 2.
Apply α-β pruning to the following two-player game tree. (a) how many evaluations, i.e. visiting terminal nodes, are saved due to α-β pruning over MiniMax? (b) what version of this tree do further improvements offer concerning the number of evaluations?
3) Consider the following game tree in which the root corresponds to a MAX node and the values of a static evaluation function, if applied, are given at the leaves. MAX MAX L MIN B M N 3 R S 0 1 7 T 5 W x 10 K Y 2 6 2 d) Is there a different ordering of the children of the root for which more pruning would result by Alpha- Beta? If so, state the order. If not, say why not. e) Now assume your opponent chooses her move uniformly at random (e.g., if there are two moves, ½ the time she picks the first move and the time she picks the second) when it's her turn, and you know this. You still seek to maximize your chances of winning. What are the "backed up" values computed at each node in this case? Write your answers to the RIGHT of each node in the tree above.
Search in a tree Given the following search tree with root node S and goal state G. The states of the nodes and their heuristic values (h-value) are shown. The step costs are shown along the edges. Tie breaking is based on the alphabetical order of the node's state name, i.e., in the order of A, B, C..... D:4 2 1 6:0 A:2 1 M.S 1:6 C3 3 1 E:7 5:4 H8 89 fav F:4 K-2 11 Is the heuristic admissible? Yes No
* Simulate the node expansion from start state (s) to reach goal state (G) - Using Geedy, A* - Given heuristic function: h(a) = 8.0 h(b) = 9.0 h(c) = 7.0 h(d) = 5.0 h(f) = 4.0 h(h) = 2.0 h(g) = 0 h(j) = 3.0 h(i) = 1.0
10. Fill in the values for the empty nodes in the following game tree according to Minimax, where the max player takes square nodes and min player takes circle nodes. 16 5 12
2. Show the B+‐tree of order three (namely each node has a maximum of three keys/descendents) that result from loading the following sets of keys in order: a. M, I, T b. M, I, T, Q, L, H, R, E, K c. M, I, T, Q, L, H, R, E, K, P d. M, I, T, Q, L, H, R, E, K, P, C, A
You perform 2-fold cross-validation to tune the MaxDepth hyperparameter of a decision tree classifier. The MaxDepth hyperparameter can take one of 3 possibles values: {1,2, 3}. These are the accuracies you obtain for each MaxDepth on each fold: Fold MaxDepth 1 3 1 0.9 0.8 0.5 2 0.5 0.8 0.6 What is the MaxDepth hyperparameter chosen by this procedure ? 01 O 2 O 3
Question in image
Consider the following dataset in which F, G and H are features and C is the class label. Explain which root node would be chosen by the entropy-based decision tree classifier described in the lecture slides. F G H Maybe Yes Yes Yes Yes Yes No No No Yes No No Yes Yes Yes Yes Maybe Yes No No Yes Yes Yes Yes Maybe Yes Yes No No Yes No No Maybe Yes Yes Yes 22 2 223