Professional Documents
Culture Documents
Problems, Problem Spaces, and Search?
Problems, Problem Spaces, and Search?
Search?
Defining the problem
4 3
3 3 2
4 2 7
0 2 5 or
12 2 0 9 or 11
Solution : path / plan
Page 6 323-670 Artificial Intelligence
Lecture 4-6
Formal description of a problem
(4,0) (0,3)
(0,0)
(4,0) (0,3)
Is Marcus alive?
on(c,a).
on(b,d).
ontable(a).
ontable(d).
clear(b). c b
clear(c). a d
hand_empty.
1. Decomposable Problem
Block world problem
2. Can solution steps be ignored or undone?
Ignorable : theorem proving
solution steps can be ignored
Recoverable : 8 puzzle
solution steps can be undone
(backtracking)
Irrecoverable : chess
solution steps can not be undone
Page 16 323-670 Artificial Intelligence
Lecture 4-6
Seven problem characteristics
Algorithm DFS:
1. If the initial state is a goal state, quit and
return success.
2. Otherwise, do the following until success or
failure is signaled:
Generate a successor, E, of the initial state. If
there are no more successors, signal failure.
Call Depth-First Search with E as the initial state.
If success is returned, signal success. Otherwise
continue in this loop.