Depth-First Search

CSC 450–Artificial Intelligence
Tutorial 5
Student Name: ……………………………………………. Student Index: ……………..
Total Marks: 10
Answer all questions
Q1:
A. Consider the following the 8-puzzle problem
(4 Marks)
Define the following
1. States?
……………………………………………………………………………………………………
2. Actions?
……………………………………………………………………………………………………
3. Goal test?
……………………………………………………………………………………………………
4. Path cost?
……………………………………………………………………………………………………
B. what is the basic idea of tree search algorithms?
(1.5 Marks)
………………………………………………………………………………………………
………………………………………………………………………………………………
Q2:
Consider the state-space graph drawn below; the start and goal states are labeled. For
each of the search strategies listed below in order, the states expanded.
1
Breadth-First Search
(1.5 Mark)
States expanded:
…………………………………………………………………………………
Uniform-Cost Search
(1.5 Mark)
States expanded:
…………………………………………………………………………………
Depth-First Search
(1.5 Marks)
States expanded:
………………………………………………………………………………….
Good Luck
2