This preview shows pages 1–4. Sign up to view the full content.
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: NAME: SID#: Login: Sec: 1 CS 188 Introduction to Spring 2006 Artificial Intelligence Practice Final You have 180 minutes. The exam is openbook, opennotes, no electronics other than basic calculators. 100 points total. Don’t panic! Mark your answers ON THE EXAM ITSELF. Write your name, SID, login, and section number at the top of each page. For true/false questions, CIRCLE True OR False . 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. 1. (20 points.) True/False Each problem is worth 2 points. Incorrect answers are worth 0 points. Skipped questions are worth 1 point. (a) True/False : All MDPs can be solved using expectimax search. (b) True/False : There is some single Bayes’ net structure over three variables which can represent any prob ability distribution over those variables. (c) True/False : Any rational agent’s preferences over outcomes can be summarized by a single real valued utility function over those outcomes. (d) True/False : Temporal difference learning of optimal utility values (U) requires knowledge of the transition probability tables (T). (e) True/False : Pruning nodes from a decision tree may have no effect on the resulting classifier. 2 2. (24 points.) Search Consider the following search problem formulation: States : 16 integer coordinates, ( x, y ) ∈ [1 , 4] × [1 , 4] Initial state : (1 , 1) Successor function : The successor function generates 2 states with different ycoordinates Goal test : (4 , 4) is the only goal state Step cost : The cost of going from one state to another is the Euclidean distance between the points We can specify a state space by drawing a graph with directed edges from each state to its successors: 1 2 3 4 1 2 3 4 x y Uninformed Search Consider the performance of DFS, BFS, and UCS on the state space above. Order successors so that DFS or BFS explores the state with lower ycoordinate first. a) What uninformed search algorithm(s) find an optimal solution? What is this path cost? b) What uninformed search algorithm(s) find a shortest solution? How long is this path? c) What uninformed search algorithm(s) are most efficient ? How many search nodes are expanded? Heuristic Search Use the Euclidean distance to the goal as a heuristic for A * and greedy bestfirst search: d) What heuristic search algorithm(s) find an optimal solution? e) What heuristic search algorithm(s) find a shortest solution? f) What heuristic search algorithm(s) are most efficient ? How many search nodes are expanded? NAME: SID#: Login: Sec: 3 In this family of gridbased problems, we can specify a state space by drawing a graph with directed edges from each state to its successors. Assume the search procedures order successors so that DFS or BFS explores the state with lower ycoordinate first....
View Full
Document
 Fall '10
 AliceOh
 Artificial Intelligence

Click to edit the document details