VI Semester B. Tech (Computer Engineering)......

2021-22
Subject : Artificial Intelligence Paper code ..CO304
Assignments ......I
Q1. Write down an algorithm for non intelligent and intelligent program for tic
tac toe problem.
Q2. Generate production rules for following problems:
(i) Water Jug problem
(ii) Block words problem
(iii) Tower of Hanoi
(iv) Missionaries and Cannibals
Q3. Give an example of a problem for which breadth first search would work
better than Depth first search. Give an example of a problem for which
depth first search would work better than breadth first search.
Q4. For each of the following types of problems, try to describe a good
heuristic function and control strategy:
(i) Blocks World Problem.
(ii) Theorem Proving.
(iii) Missionaries and Cannibals Problem.
Q4. Write the algorithm for Water Jug problem using:
(i) Breadth- First Search Technique.
(ii) Depth- First Search Technique.
(iii) Best First Search Technique.
Q5. Can you find a heuristic function for the 8-puzzle problem? Solve it
using:
(i) Breadth- First Search Technique.
(ii) Depth- First Search Technique.
 (iii) Hill Climbing.

1 2 3
8 5 6
4 7

1 2 3
4 5 6
7 8

Q6. Consider the following map.

Using the A* algorithm work out a route from town A to town M. Use the following cost
functions.

⮚ G(n) = The cost of each move as the distance between each town (shown on map).

⮚ H(n) = The Straight Line Distance between any town and town M. These distances are
 given in the table below.

Provide the search tree for your solution and indicate the order in which you expanded the
nodes. Finally, state the route you would take and the cost of that route.

Straight Line Distance to M

A 223 E 165 I 100 M 0
B 222 F 136 J 60
C 166 G 122 K 32
D 192 H 111 L 102

ii) The straight line distance heuristic used above is known to be an admissible heuristic.
What does this mean and why is it important?

Q7. Work out the steps of A* algorithm for slide back puzzle having
following moves:

i. A tile may move to adjacent cell with unit cost

ii. A tile may hope another tile with a cost of 2

Q.8 Write and explain Constraint satisfaction algorithm. Using the algorithm
solve the problem.
COE
+ DCE
BEST
Q9. Briefly describe the operation of the AO* search technique for the
following search tree:

Q10. Explain the constraint satisfaction algorithm. Use it to solve the following
problem:
 DONALD
+ GERALD

ROBERT