INDIAN INSTITUTE OF INFORMATION TECHNOLOGY, NAGPUR

Department of Computer Sciences and Engincering

End Semester Examination
N Jan-May 2023
CSL421: Artificial Intelligence
Duration: 3:00Hrs Max. Marks: 60
Date: 09/05/23 Time: 10:00 am to 1:00 pm
Important Instructions:
All questions are compulsory.
Assume suitable data wherever necessary.

au(A) How willyou apply local beam search on 4-queens problem? Consider it as a (5] CO2

minimization problem. Show all the steps of one iteration untilthe next
generation is created. Assume that there are kstates in the initial population with
k-4. Clearly indicate if you get asolution or not after the first iteration.
Q1(B) Suppose you are solving a minimization problem using hill climbing algorithm CO2
for which the solution has an evaluation function's value as 0. You have already
rn a few iterations of the algorithm and now the curren state has a value 15. The
branching factor is 6. Answer the following questions:
i When you generate all possible successor states, you find that you are
stuck in a local minima. What could be the possible values of each of the
successor states in this case?
il. Suppose now you are stuck in a plateau. What could be the possible
values of each of the successor states in this case? Will you allow
sideways moves? If yes why? If not give reasons.
(10] C03
02 You are in charge of scheduling for computer science classes that meet
Mondays, Wednesdays and Fridays.
There are 5 classes that meet on thcse days and 3 professors who will be
teaching these classcs. You are constraincd by the fact that cach professor can
only teach one class at a time.
The classes are:
" Class l -Intro to Programming: meets from 8:00-9:00am
8:30-9:30am
" Class 2 - Intro to Artificial Intelligence: neets from
"Class 3-Natural Language Processing: meets from 9:00-10:00am
" Class 4 -Computer Vision: meets from 9:00-10:00am
"Class 5 - Machine Learning: meets from 9:30-10:30am
The professors are:
" Professor A, who is available to teach Classes 3 and 4.
" Professor B, who is available to teach Classes 2, 3,4, and 5.
" Professor C, who is available to teach Classes 1, 2, 3, 4, 5.

i) Formulate this problem as a CSP problem in which there is one

varíable per class, stating the domains, and constraints. Constraints
should be specified fornally and precisely, but may be implicit
rather than explicit.
ii) Draw the constraint graph associated with your CSP.
iii) Give a solution to this CSP using Forward checking and heuristics.
CO4
Q3(A) Consider the following Knowledgebase (KB) consisting of three rules, RI, R2
[5]
and R3. Goal query is given below
 Hirs

R1: Allcats like fish

like
R2: Cats eat everything they
R3: Ziggy is a cat.
fish?
Goal query: Does Ziggy eat First Order Logic sentences.
KB into
i) Convert the prove that Ziggy cats fish.
Forward chaining and
i) Use
(5] Co4
sentences in First order logic:
Q3(B) Represent the following

i) Ones mother is one's female parent

ii) One's husband is onc's male spousc
ii) Malc and femalc arc disjoint categories
iv) Parct and child are invcrse relations
v) A grand parent is a parcnt of one's parent
CO4
consisting of three rules R1, R2 and
Q4(A) Consider the following Knowledge Base dente the row and column index
R3in the context ofWumpus world. Indices (i.)
respectively. Answer the following questions
of
Rl: If there is breeze in cell(2,1) then there could be pit in any or all
the cells (1,1)(2,2) and (3,1) and vice versa is also trure.
R2: There is breeze in cell (2,1)
R3: There is no pit in cell(1,1)
i) Represent the albove sentences in Propositional logic sentences
ii) this information sufficient to infer that there is no pit in cell(3,1)?
Using Truth Table enumeration method, give justification of your
answer.

Q4(B) Trace the operation of Recursive Best First Search algorithms applied to the CO1,
CO2
problem of getting to Bucharest from Lugoj using the straight line distance
heuristic. The Graph is given below and the heuristic values (straight line
distance to Bucharest) are given in the following table. Clearly indicate the
forgotton subtree(s).

Zr:ind
lasi

Sibiu F:uaras
Vaslui

limaicu Vilkua
GTinia
42
) Pitcsti

8 Himv
0 Ltzicenl
S6
138 Bucharst
Dywta 3--.0
Ciuiova Giwgia

Arad Bucha Craiova Dobreta Eforie Fagaras Giurgiu

rest
366 160 242 161 176 77
 Hirsova lasi Lugoj Mehadia Neamt Oradea Priesti
151 226 244 241 234 380 100

Rimnicu Sibiu Timisoara Urziceni Vaslui Zerind

Vilcea
193 253 329 80 199 374

QS(A) Consider the following two player game tree. Empty squares and circles denote (5] CO3

the MAX and MIN nodes respectively.Apply alpha-beta search and find out the
optimal move for MAX player, initially. Indicate your solution by drawing the
game tree. Clearly indicate the branches that are pruned.

10 20 100 5 15 65 75 ý00 30 30

O5(B) Consider the following statement: "The number of nodes pruned using alpha (3] CO3
beta pruning depends on the order in which the nodes are evaluated." State True
or False and give justification of your answer.
Q5(C) Write the criteria to decide the evaluation function in case of cut-off in practical [2] CO3
games. Give justification of your answer with appropriate example.
06(A) Consider the following domain description in the context of air cargo problem: [6] COS
Airport(a), Plane(p), Cargo(c)
At(p,a),
At(c,a), In(c,p)
The three legal actions are as follows: ILoad(c,p,a), Fly(P,a1,a2), Unload(c,p,a)
Suppose the initial state is At(C1,A1)AAt(P1,Al) and you are solving this
planning problem using Forward State Space Search to reach to goal state
At(C1,A2). Answer the following questions.
i) Identify preconditions, positive and negative effects for the legal actions
mentioned above.
ii) Show the step by step solution.
iii) What is the drawback of progession planner?
Q6(B) Compare Greedy best first search, A*search and Unlform Cost Search algorithms using [4] CO2
the metric given below:
i) Number of nodes generated
i) Optimality
ii) Completeness