HOMEWORK 3:  Uninformed (i.e., no heuristics) State Space Search
 

Handed out/Assigned:	Tuesday, March 18, 2003
Due:	Thursday, March 27, 2003

FROM THE TEXT:  Chapter 8,  (Read it!  It has lots of good stuff), pp. 137-138:  8.2  AND 8.5.

OUR VERY OWN PROBLEM:

•   Assume our original, 3 blocks BlocksWorld, in which the only operators are "move(column_num, left)" and "move(column_num, right)", and there are only three columns (numbers 0,1,2).

Here is a state space diagram going from initial state:

A
B
C

 to goal state:

	A
C	B

• Now draw the state space diagram for a FORWARD CHAINING (initial-to-goal) search.  Label each (directed) edge with the exact operator used tomake the state transition.  Include duplicate states, but do not expand them (i.e., assume the search algorithm detects duplicate states):

• Now draw the state space diagram for a BACKWARD CHAINING (goal to initial) search:

For this problem, which is faster?  Forward or backward chaining?