WA1 (Out: Sept 11, 2007; In: Sept 20, 2007 in class)
(From Ginsberg, "Essentials of AI") A farmer is trying to cross a river with a fox, a chicken and a bag of grain. He has a rowboat that he can use to carry any single item across the river, but he cannot afford to leave either the fox unattended with the chicken or the chicken unattended with the grain.
(1) Design a state space representation for this problem. Specify clearly the meaning of each part of the data structure and variables. Include in your design a complete set of operators in this domain based on the above representation, including pre and post conditions.
(2) Draw a search graph for this problem that includes at least a path to the goal state. Mark clearly the initial and goal states, as well as a solution path.
(3) Beside each state in the graph, or in a separate table, mark the corresponding g* and h* and f* values for each state.
PA1 Out: Sept 13, 2007. The Sokoban Problem
WA2 Out on Oct 9, 2007. (due Oct 18, 2007 in class):
WA3 Out on Nov 7, 2007. (due Nov 20 2007 in class):
PA2: Out on Nov 13, 2007 (Due on Nov 26, 2007, 11:59pm)
Final Project: Final Project Requirement