SECTION A: TRUE/FALSE For cach of statements, indicate whether the statement is TRUE or FALSE. Please write the symbol “A” to indicate that the statement is TRUE and “B” to indicate that the statement is FALSE, Answers should be written in the column hat is provided NO | STATEMENT ‘ANSWER ‘Aificial Intelligence (AT) i the study of how to make computers do _| things which, atthe moment, people do beter. Problem formulation isthe process of deciding what actions and sales to consider, given a goal desirable ate) ‘Search isthe process of looking for a sequence oF aotons that reaches the ol stat, Uncertainty exists in games environment die to presence of opponent player who has distinct skis and experience. ‘A® search combines greedy and breadth-ist search to find extimated cheapest solution path to the goal. Bread sear s implemented wsing LIFO queue to case Wat nodes thal are visited first wil be expanded fis. Propositional logic is a language which consists of propositional connectives and logical symbols. “The closed list sores the fringe of unexpanded nodes, ‘SiblingOf (Ali, Ahmad) => SibtingOf Ahmad, Ati) “The above sentence isan example of atomic sentence. ‘An agent peresves its environment through actuator. Pe Bp] | >| >>] > TS mons A 1G = 1S marks Page 1 oF 6 ‘ressni4/71SECTION B : STRUCTURED QUESTIONS ‘Answer ALL questions, Question 1 The following game tree should be referred ta in order to a (@) Apply minimax algorithm to determine the values for nodes B, C, D,E, F,G,H and I. (b) Whats the best move fornode A (B or C) ? What values does nade A expect to recive? (©) Rela the above game troc and perform alphabet pruning on the game tes, Finpomnt Which part ofthe game tree should be pruned. ( B2F C-H D+F EB FR Gk HAE Tog (o Smaies x8= hws ) () Beswmoves BASF (isa = 3 motes) Oo AL Page 2 of 6 ‘TESS /TICSISIQuestion 2 (@) Distinguish berwoen the following two fiames. Draw a parent frame named Animal and child frame named Lion. Bach fame should have four slots. (©) The following sentences are available in Knowledge Base (KB). Using Logical [Equivalencae Rules and Inference rules, prove that it ie possible to derive Bw. cach step of proving, indieate the rule(s) tat is/are being used. te ate Zee \ RASB oe [ - at Lite War @ Tavtaecs ef evnsl Frame, We flags 0-H ret bg + a TJ] Geiee © dopenden sfeces Golo yellow 3 = Tetanen” Rhea E [| itcanes pre eeeome tee Mee De 2 motes Gath thodas Breas < be : a GBA einen Ce et AL Page 3 of 6 TESSIL1 /TIC3IS1Question 3 The following map of cities and table of heuristic values are used to answer the following sub- questions. Inthe map, each cities are connected and direction of links are specified For example, the link between node A and node B inthe map indicates that you can go from City A to Ciy B bat not the vice versa. Assume that each step cost is 1. Assume thatthe intial state is City A'and the goal state is City H ‘Name of City_| "Heuristic value A eer] B | eo Db aerial E a [eeeaer 3 G 2 aE o (@) Apply greedy best-first search algorithm in order to draw the search tree. (©) Identify the solution path generated from Question 3 (a, (©) Calculate the total path cost of the solution path from Question tb) (©) Using breadth-frst search, lst the changes tothe content of fringe (step by step) in order {obtain TWO possible solution paths from the initial state tothe goal state Nodes athe same level should be sorted alphabetically from left to right. For example, ifthe parent ‘ode has wo child nodes (Z and Y), node Y should be placed on the lft hand sie ofthe tees white node Z is placed on the right hand side of the tee. The inital content ofthe fringe is done for you as below, 1a) 1) Silichen poh 9 a A-CP-6-B Comet.) a Dt Game) © © © F mols hy aL Paged of 6 TESS /TICSISLAL = DA D BC 3) OD,E y) DE DF 5) EEG 6) dF, GHDH 4) GHD HGH 8) GW DMG MG a) A, DH GAG jo) D/B,G/4,6,4 Nn) HG, 4, GW GH 12) G,8,G,H,6,4 Page 5 0f 6 L moses ‘TESSII1 /TICSIS1