Session 6 Activity

Bring to class on Friday, September 7th

 

Consider the following search space:

Start State: 1

Successor Function: S(n) = 2n and S(n) = 2n+1

In other words, the successors of 1 are 2 and 3. The successors of 2 are 4 and 5

Goal State: 11

Path Cost: 1 per transition

 

1) Draw out the search tree for depth=0 through depth = 3

2) List the order the nodes are visited during a breadth first search from start to goal state.

3) List the order the nodes are visited during a depth first search from start to goal state.

4) List the order the nodes are visited during a depth limited search with a limit of 4, from start to goal state.

5) List the order the nodes are visited during an iterative deepening search from start to goal state.