United International University

Department of Computer Science and Engineering

CSI 341 Artificial Intelligence (Section A),
Class Test 1, Summer 2020
Total Marks: 20, Time: 30 minutes

1. Suppose you are designing an agent for a two player game. The game is played on a grid
like below:

B(3,3)

A(0,0)

Initially Player A is at location(0,0) and player B is at location (3,3). At each step, player A and
player B takes turn to move one step horizontally or vertically. When the two players meet the
game ends.

Answer the following:

a. What variables are required to represent a state of the problem?[1]

b. How many states are there in the state space? Explain your calculation.[2]
c. How many goal states are possible? Explain your calculation.[2]
d. What is the goal test?[1]
2. Consider the state-space graph in the following figure. Considering S as the start node
and G as the goal node, find out the solution paths and costs returned by the following tree-
search algorithms. In case of ties, use alphabetical order to choose nodes. [2+2+3+3=10]
a. BFS
b. DFS
c. IDS
d. UCS

3. Is Breadth First Search optimal? What is the time and space complexity of Breadth First
Search? Explain your answer. [4]