CSL302 Artificial Intelligence
Quiz 2, 19-1-2017
Name:
Roll Number:
1. Prove the following statement, or give a counter example (6 points)
a. Breadth-first search is complete even if zero step costs are allowed.
b. The path determined by uniform cost search to the goal state can change if we add a
positive constant to every edge cost.
c. The time complexity of Iterative deepening search is always better than depth first
search
2. Consider a state space where the start state is 1 and the child generator function for state 𝑖
returns two states 2𝑖, 2𝑖 + 1.
a. Draw the state space graph for states 1 to 15 (2 points)
b. Suppose the goal state is 11. List the order in which nodes will be visited for
i. Breadth first search (2 points)
ii. Depth limited search with search depth limit 3 (2 points)
iii. Iterative deepening search (3 points)