Network:	Search tree:
Search stack:
Node: S 1 2 3 4 5 6 7 8 9 10 11 12 G Heuristic: S 1 2 3 4 5 6 7 8 9 10 11 12 G
Search program: 0. while limit < maximum tree depth 1.  add initial node to stack 2.  while stack is not empty 3.   remove node x from stack 4.   if node x is goal node then return 5.   for each node y connected to node x 6.    if node y in explored or stack then continue 7.    if depth of node y > limit then continue 8.    add node y to stack 9.    order stack by path length 10.   if stack contains goal node then return 11.   add node x to explored 12.  increase limit	Options: Search depth limit: Animation speed: Search algorithm: Depth first search Depth limited search Iterative deepening search Breadth first search Uniform cost search Greedy best first search A* search Skip nodes already on stack