PSet 2: more basic search
(videos up to and including DFS+DFID)
In the graph below, run depth first search with G as the start state and K as the goal. When vertices are added to the stack, push them in alphabetical order (so they would be popped in reverse). Show the open stack. Show the start states. Show the search tree, and clearly show the order that nodes were expanded. Only stop when the goal state is selected for expansion.
What path was found?
Was the found path also the shortest possible path?

Perform the same search with DFID. Show the search tree for each depth. Did you find the optimal path?