Mid Term Exam

Credit Hours: 3 Time allowed: 2:30 Hrs

Artificial Intelligence Maximum Marks: 25
Course Code: CS-331

Question No-1: Differentiate the following with the help of diagram. Marks [2+3=5]

a. Briefly compare and contrast a depth first search technique with a breadth first search technique under
the following headings: (i) Reaching Optimal Solutions and (ii) Memory Efficiency
b. Prove that the A* heuristic search algorithm is optimal when applied in conjunction with a monotonic
heuristic. State the conditions under which the algorithm is also complete, and explain why this is the
case.

Question-2: State the Following Marks [4]

(a) Apply minimax to the game tree in Figure 2. Which move should be chosen if the root is a maximizing player?
Which move should be chosen if the root is a minimizing player? Marks [4]

Figure 2

(b)

Figure 1
1. What is the order of states expanded using Depth First Search?
2. What is the order of states expanded using Breadth First Search?
3. What is the order of states expanded using Best First Search?
4. What is the order of states expanded using Iterative deepening Search?
(b) Apply alpha-beta pruning to the game tree in Figure 3, where static scores are from the maximising player’s point
of view. Which nodes need not be examined in a left to right alpha-beta pruning? Which nodes need not be examined
in a right to left alpha-beta pruning? Marks [6]

Max

Figure 3

(c) Consider the following situation in “blocks world” (See Figure 4), where there are five blocks of interest. Two
operators can be applied: pick up a block and put it on the table; pick up one block and put it on another block. Apply
hill-climbing to solve the problem using the following heuristics: add one point for every block that is resting on the
block it is supposed to be resting on; subtract one point for every block that is sitting on a “wrong” block. Draw the
search tree for your solution. Show the order in which the nodes were expanded. Marks [3]

Figure 4
(d) Apply the A* algorithm to find a shortest path from town A to town Z (see Figure 1) using the straight-line
distance between each town and town Z as the heuristic at each node.
Marks [3]

Draw the search tree for your solution. Show the order in which the nodes were expanded and indicate the cost of each
partial solution path.

++++++++++