Artificial Intelligence: A Modern Approach
3rd Edition
ISBN: 9780136042594
Author: Stuart Russell, Peter Norvig
Publisher: Prentice Hall
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 5, Problem 7E
Explanation of Solution
Assertion
- Consider a MIN node whose children are terminal nodes.
- If MIN plays suboptimally, then the value of the node is greater than or equal to the value it would have if MIN played optimally...
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
illustrates the procedure to obtain the optimal binary search tree,given the list of keys ? = {a1,a2,.....an} and the probabilities Pi, 1≤ ? ≤? andQi,0≤ ? ≤n
I need a solution to this question quickly
-Given the following search tree, apply the Expected Minmax algorithm to it and show the search tree that would be built by this algorithm.
-Who is the winner player and what is his final utility value?
Please don't use handwritting for this question
How would you modify the dynamic programming algorithm for the coin collecting problem if some cells on the board are inaccessible for the robot? Apply your algorithm to the board below, where the inaccessible cells are shown by X’s. How many optimal paths are there for this board? You need to provide 1) a modified recurrence relation, 2) a pseudo code description of the algorithm, and 3) a table that stores solutions to the subproblems.
Chapter 5 Solutions
Artificial Intelligence: A Modern Approach
Knowledge Booster
Similar questions
- The accuracy in the output depends on the correct inputs. The model designed is supposedto be evaluated to determine the accuracy and it is supposed to function in a supervisedway. Hence the data sets can affect the model and vice versa.Given P(D|M) ,P(M) ,and P(D'|M), solve the followinga)Draw the probability tree for the main situationB)Draw the reverse tree for the main situation.C)Using the main tree, prove all probabilities on the opposite tree.D) If P(DIM) = 0.3,P(M) = 0.1 ,and P(D'IM) = 0.65 find P(D)arrow_forwardYou use your favorite decision tree algorithm to learn a decision tree for binary classification. Your tree hasJ leaves indexed j = 1, . . . , J. Leaf j contains nj training examples, mj of which are positive. However,instead of predicting a label, you would like to use this tree to predict the probability P(Y = 1 | X) (whereY is the binary class and X are the input attributes). Therefore, you decide to have each leaf predict a realvalue pj ∈ [0, 1]. -What are the values pj that yield the largest log likelihood? Show your work.arrow_forwardAssume we have three binary input attributes, A, B, C, and one binary outcome attribute Y. The three input attributes, A, B, C take values in the set {0,1} while the Y attribute takes values in the set {True, False} a. Which attribute (A, B, or C) has the highest information gain? b. Construct the full decision tree for this problem, without doing any pruning. If at any point you have a choice between splitting on two equally desirable attributes, choose the one that comes first alphabetically. If there is a tie on how to label a leaf, then choose True.(NEED ONLY HANDWRITTEN SOLUTIION)arrow_forward
- Which of the following statement is TRUE about overfitting problems? It is impossible for regression models to have overfitting problems. Increasing the depth of tree might cause overfitting problems in decision tree learning. Overfitting problems can be reduced by decreasing the value of k in k-NN algorithm. If a model has high training set error and low testing set error, the model overfits.arrow_forwardAlice and Bob are sharing a cake. First Alice divides the cake into two pieces, then Bob chooses one piece, leaving Alice with the other piece. Alice can either divide the cake in half (a ratio of 1 : 1) or in a 1 : 2 ratio. Modeling this as a game gives the following game tree. For each of the following scenarios, write down the value for each of the three non-terminal nodes of the game treeIn other words, write down the utility that Alice should expect to receive in each of the game states given knowledge of the player strategies described below. Suppose both Alice and Bob are playing adversarially, each trying to maximize the amount of cake they receive. Suppose Alice still tries to maximize her share of the cake, but now Bob plays collaboratively, working to also help Alice get as much of the cake as possible. Suppose Alice still tries to maximize her share of the cake, but now Bob plays randomly, choosing the larger piece of cake with probability p. The state values will now be…arrow_forwardIn one or at most a few sentences, describe the distinctions between a random forest and a decision tree. How can we use the random forest technique to ensure that we randomize twice?arrow_forward
- Construct an optimal binary search tree for five keys A, B, C, D, E with probabilities p1 = 0.1, p2 = 0.3, p3 = 0.1, p4 = 0.4, p5 = 0.1. Show(1) the main table; (2) the root table; (3) all computations to fill in the main table and the root table; (4) the optimal binary search tree based on the root table; (5) that the average number of comparisons of your optimal binary search tree is indeed C(1,5).arrow_forwardUsing the image provided, please answer the following questions. (a). Find a path from a to g in the graph G using the search strategy of depth-first search. Is the returned solution path an optimal one? Give your explanation and remarks on "why-optimal" or "why-non-optimal". (b). Find a path from a to g in the graph G using the search strategy of breadth-first search. Is the returned solution path an optimal one? Give your explanation and remarks on "why-optimal" or "why-non-optimal".(c). Find a path from a to g in the graph G using the search strategy of least-cost first search. Is the returned solution path an optimal one? Give your explanation and remarks on "why-optimal" or "why-non-optimal". (d). Find a path from a to g in the graph G using the search strategy of best-first search. The heuristics for these nodes are: h(a,25); h(b, 43); h(c,5); h(d, 64); h(g, 0). Is the returned solution path an optimal one? Give your explanation and remarks on "why-optimal or "why-non-optimal".…arrow_forwardConsider the vacuum-world problem defined as shown in the following figure. a. Which of the algorithms defined in this chapter would be appropriate for this problem? Should the algorithm use tree search or graph search? b. Apply your chosen algorithm to compute an optimal sequence of actions for a 3×3 world whose initial state has dirt in the three top squares and the agent in the center. c. Will you prefer an agent with state/ memory in this scenario? d. Compare your best search agent with a simple randomized reflex agent that sucks if there is dirt and otherwise moves randomly. e. Consider what would happen if the world were enlarged to n × n. How does the performance of the search agent and of the reflex agent vary with n?arrow_forward
- Let's look at the minimax search tree illustrated in Figure 2. In this diagram, black nodes represent decisions made by the MAX player, while white nodes represent decisions made by the MIN player. The squares at the terminal nodes represent payments, with the number indicating the amount paid from MIN to MAX (a 0 indicates no payment from MIN to MAX). MAX aims to maximize the payment they receive, while MIN aims to minimize the payment they make. If we apply the α-β pruning algorithm, we can analyze the minimax tree as shown in Figure 2. (a) Assume that we iterate over nodes from right to left; what are the arcs that are pruned by α-β pruning, if any? (b)Does you answer change if we iterate over nodes from left to right?arrow_forwardConsider the vacuum-world problem defined as shown in the following figure-1. a. Which of the algorithms defined in this chapter would be appropriate for this problem? Should the algorithm use tree search or graph search? b. Apply your chosen algorithm to compute an optimal sequence of actions for a 3×3 world whose initial state has dirt in the three top squares and the agent in the center. c. Construct a search agent for the vacuum world, and evaluate its performance in a set of 3×3 worlds with probability 0.2 of dirt in each square. Include the search cost as well as path cost in the performance measure, using a reasonable exchange rate. d. Compare your best search agent with a simple randomized reflex agent that sucks if there is dirt and otherwise moves randomly. e. Consider what would happen if the world were enlarged to n × n. How does the performance of the search agent and of the reflex agent vary with n?arrow_forwardImplement the algorithm for an optimal parenthesization of a matrix chain product as dis-cussed in the class.Use the following recursive function as part of your program to print the outcome, assumethe matrixes are namedA1, A2, ..., An.PRINT-OPTIMAL-PARENS(s, i, j){if (i=j) thenprint “A”i else{print “(”PRINT-OPTIMAL-PARENS(s,i,s[i, j])PRINT-OPTIMAL-PARENS(s, s[i, j] + 1, j)print “)”} }a- Test your algorithm for the following cases:1. Find and print an optimal parenthesization of a matrix-chain product whose sequenceof dimensions is<5,10,3, X,12,5,50, Y,6>.2. Find and print an optimal parenthesization of a matrix-chain product whose sequenceof dimensions is<5,10,50,6, X,15,40,18, Y,30,15, Z,3,12,5>. 3. Find and print an optimal parenthesization of a matrix-chain product whose sequenceof dimensions is<50,6, X,15,40,18, Y,5,10,3,12,5, Z,40,10,30,5>. X=10 Y=20 Z=30arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Operations Research : Applications and AlgorithmsComputer ScienceISBN:9780534380588Author:Wayne L. WinstonPublisher:Brooks Cole
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole