Problem 3.7 a, b, and d. Specify the following FORMALLY in set theoretic
notation or function notation as needed:
the state space S
the initial state s
the goal test g
the set of actions A
the cost function c (default is cost 1 for every action
if there is no cost specified in the problem formulation)
Problem 3.9.
For part a
Your formalism should include the same elements as in 3.7.
In your diagram, indicate which states are "dead states." Correction: You do not need to show dead states in your state diagram
For part b
First with a blind depth-first search using a stack and/or recursion.
Second with a blind breadth-first search that uses a queue.
Avoid repeated states.
Count how many states are searched to find the FIRST
solution. Then have your search go on to find all of them. Do
let your program go to "dead" states and count them, but then back up.
You may use Java, C++, Lisp or Lisp variant.
Please comment each method, describing its purpose, arguments and return value.
Please comment important sections of code; 'This is the main loop', 'This checks for repeated states', etc.
Your program should print out all paths it finds to the goal state (and it should find all possible paths
that don't repeat states).
You should turn in the following:
Hand in a printed copy of the non-programming portion of the assignment in
class on the due date. Include a print-out of your programs' output (a list of all paths to the solution)
for both the DFS and BFS.
Email Tyler your code before class on the due date.
