Name: a Student 1D: CSE.473 Autumn 201 jerm Exam (closed book, closed notes except for I-page summary) Total: 100 points, 5 questions. Time: 50 minutes Instructions: 1. Write your name and student ID on the first sheet (once you start, write your last name on al sheets). Write your answers in the space provided. If you need more space or scratch paper, you can get additional sheets from the instructor. Make sure you write down the question number and your name on any additional sheets. 2. Read all questions carefully before answering them. Feel free to come to the front to ask for clarifications. 3. Hint I: You may answer the questions in any order, so if you find that you're having trouble with one of them, move on to another one, 4, Hint 2: If you don’t know the answer to a question, don’t omit it - do the best you can! You may still get partial credit for whatever you wrote down. Good luck! Do not start until you are given the “go-ahead signal”Name: Student ID: 1) 20 points, 10 each) Agents and Environments a) Give a PEAS description of the task environment for the following agents }) An autonomous Metro bus in downtown Seattle ii) A program that detects faces in a given image b) For each of the agents above, characterize the environment accor itis fully or partially observable, deterministic or stochastic, episodie or sequential, static or dynamic, discrete or continuous, and single or multiagent. a) Any reasonable omswers receive points b © parkially dhservable, Stechostic, sequential , dynamic, Contintous, multiagent: Gi Fully obsewovle, deterministic, episodic, static, discrete, Single agentName: Student ID: 2) (20 points, 5 for a, 15 for b) Uninformed Search Consider a state space where the start state is | and the successor funetion for any state x returns three states: 3x, 3c+1, 3x+2. 2) Draw the state space graph for states 1 to 32. 'b) Suppose the goal state is 30. List the order in which nodes will be vis breadth-first search, (ii) depth-limited search with depth limit 2, and (ii deepening search. 2d for: (i) iterative Ww oe 4 aN, Z™. aA 1 ly 12 13 14 1S tb 27 2B 2% 30 31 32 » ay 13,4, §, 4, (0,0, 12,13 V4, 15 Vb, (9, 24, 28, 24, 30 ui) 3, 1,19, de 12, 13, IH, S, IS 1b, IF SF —r— 27, 28,24, 10,30‘Name Student ID: 3) (20 points, 10 each) Informed Search ‘The map below shows the routes through various towns in Romania. The route distances are labeled on the edges between towns. The table on the right gives the straight line distances to Buchatest from the other towns. Becbaret Crake fe Dobrets Be aac Horie ‘81 Fouaras i stiv 99 Faawas hire e ! 2s Neha ea Sean es rates 3 esa Me rr rere RinmicuVikes 499 Sie S Tinos 33 Usteet 3p an Consider the route-finding problem of computing the cheapest path from Oradea to Bucharest. For the straight-line distance heuristic, draw the search tree after expansion of each node until the termination of the algorithm for: a) Greedy best-first search (label all nodes with their h values). What is the solution (list of visited cities) found by the algorithm? b)_A* search (label all nodes with their f values). What is the solution (list of visited cities) found by the algorithm? Use this page and the next for your answers. %) ‘) Orodes Onda, 380 23 ra Beinl Sha rn 12983 frttus Feeey Grd Read” Fagares Rimwen Grodan Arad Foges Rrwien feter F659 Feinh VASES, beagg WM Wee ye a em eS eo a SK Bucharest Sib Coxover Pitest ie753 ho Fete Foyt fg Rimuion” Creve 3 Shia? Fagavas? Bucha ‘ Buchavest Orodan> Sibiu Frgpras? Brcharest, Wie lab cnn Orodden> Sin Rirnucin Vilcen Fitesti> BuchavetName: Student ID: 4) (15 points, 5 each) Adversarial Search El-32 mox( []-15) B-s B2 Bis min B]-5) EJs E> Es Ee Bes Eh4o Elis n (as) 38 00 4 420 5 8 6 2 2 35 25 4 18 50 Consider the 4-ply game tree above for a two-person game. a) Fill in the minimax values of all nodes marked 0 in the tree above. b). Label the path in the tree that results if max and min each make optimal moves. ©) Draw the tree that results if alpha-beta pruning is used. (Use the space below or the opposite blank page) wax (IS)Name: Student ID: 5) (25 points, 10 for a, 15 for b) Propositional and First-Order Logic a). State whether each of the following sentences in propositional logic is valid, satisfiable but not valid, or unsatisfiable. Explain your answer. i) Av(B=>B) A B B98 Avie3e) ‘lid alge 7 valid Bt oT Ty these ove all pssity i) AAABA(A>O) ae q bserve th satishioble but not valid MER 2 pees ) Suppose a knowledge base contains the following sentences in first-order logic. ve Vy (A(x) A Clay) = 7 BO) Ye Vy [-Clxy) => DO] 3x BQ) ACdiddy) (where diddy is a constant symbol) i) Convert the sentences above to CNF (remember to standardize apart the clauses). ii) Using your CNF sentences [Feel free to use the next page (i), construct a resolution proof that D(diddy). you need more space for your answer] ee ———“ =$Etr—_— Adildy \ \ “a Cldiddy, Vv 7B 4) \ iy \ / D (diddy) o