This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CS 188 Spring 2010 Introduction to Artificial Intelligence Midterm Exam INSTRUCTIONS • You have 3 hours. • The exam is closed book, closed notes except a twopage crib sheet. • Please use nonprogrammable calculators only. • Mark your answers ON THE EXAM ITSELF. If you are not sure of your answer you may wish to provide a brief explanation. All short answer sections can be successfully answered in a few sentences AT MOST. First name Last name SID Login For staff use only: Q1. Search Traces /15 Q2. Multiplechoice and shortanswer questions /16 Q3. Minimax and Expectimax /12 Q4. npacmen search /10 Q5. CSPs: Course scheduling /12 Q6. Cheating at cs188Blackjack /19 Q7. Markov Decision Processes /16 Total /100 1 Q1. [15 pts] Search Traces Each of the trees (G1 through G5) was generated by searching the graph (below, left) with a graph search algorithm. Assume children of a node are visited in alphabetical order. Each tree shows only the nodes that have been expanded . Numbers next to nodes indicate the relevant “score” used by the algorithm’s priority queue. The start state is A, and the goal state is G. For each tree, indicate: 1. Whether it was generated with depth first search, breadth first search, uniform cost search, or A * search. Algorithms may appear more than once. 2. If the algorithm uses a heuristic function, say whether we used H1 = { h ( A ) = 3, h ( B ) = 6, h ( C ) = 4, h ( D ) = 3 } H2 = { h ( A ) = 3, h ( B ) = 3, h ( C ) = 0, h ( D ) = 1 } 3. For all algorithms, say whether the result was an optimal path (assuming we want to minimize sum of link costs). If the result was not optimal, state why the algorithm found a suboptimal path. Please fill in your answers on the next page. 2 (a) [3 pts] G1 : 1. Algorithm: 2. Heuristic (if any): 3. Did it find leastcost path? If not, why? (b) [3 pts] G2 : 1. Algorithm: 2. Heuristic (if any): 3. Did it find leastcost path? If not, why? (c) [3 pts] G3 : 1. Algorithm: 2. Heuristic (if any): 3. Did it find leastcost path? If not, why? (d) [3 pts] G4 : 1. Algorithm: 2. Heuristic (if any): 3. Did it find leastcost path? If not, why? (e) [3 pts] G5 : 1. Algorithm: 2. Heuristic (if any): 3. Did it find leastcost path? If not, why? 3 Q2. [16 pts] Multiplechoice and shortanswer questions In the following problems please choose all the answers that apply, if any. You may circle more than one answer. You may also circle no answers (none of the above) (a) [2 pts] Consider two consistent heuristics, H 1 and H 2 , in an A * search seeking to minimize path costs in a graph. Assume ties don’t occur in the priority queue. If H 1 ( s ) ≤ H 2 ( s ) for all s, then (i) A * search using H 1 will find a lower cost path than A * search using H 2 ....
View
Full
Document
This note was uploaded on 08/26/2011 for the course CS 188 taught by Professor Staff during the Spring '08 term at Berkeley.
 Spring '08
 Staff
 Artificial Intelligence

Click to edit the document details