Send your email address (right away) to littman@cs.
Let BFS' and DFS' be versions of BFS and DFS that don't check whether a state has been previously visited. Evaluate BFS' and DFS' on the four comparison criteria we discussed.
Consider the Rush Hour board from these notes. Assume a single move consists of sliding a car forward or backward some number of spaces. (a) Give an upper bound on the branching factor. (b) Assuming the solution is at depth 20, how many nodes will be searched? (c) Ignoring the search, how many states are in the search space? Give as tight an upper bound as you can.
