*This preview shows
page 1. Sign up
to
view the full content.*

**Unformatted text preview: **ICS 171, Summer 2000: Lecture 2 Homework
Stephen D. Bay August 10, 2000
Due: August 17, 2000 1 A farmer has a goat, a wolf and a cabbage on the west side of a river. He wants to get all of his animals and his cabbage across the river onto the east side. The farmer has a row boat but he only has enough room for himself and one other thing. The wolf will eat the goat if they are left together alone. The goat will eat the cabbage if they are left together alone. How can the farmer get everything on the east side? a Formulate this puzzle as search: i.e. give a state space representation, start state, goal state, and operators. b Solve this problem using search any method of your choice. Draw the search tree and show the nal solution. 2 Question 3.3 in course text Russell & Norvig, page 87 3 Consider the following graph representing the state space and operators of a navigation problem:
A D S G B E C H F S is the start state and G is the goal state. When placing expanded child nodes on a queue, assume that the child nodes are placed in alphabetical order i.e. if node S is expanded the queue will be: A B. Assume that we never generate child nodes that appear as ancestors of the current node in the search tree. 1 a What is the order that breadth rst search will expand the nodes? b What is the order that depth rst search will expand the nodes? c What is the order that iterative deepening search will expand the nodes? 4 Describe a search space where iterative deepening performs much worse than depth rst search. from R&N 3.9 5 Construct a search tree where it is possible that DFS will use more memory than BFS. 6 Suppose we have a problem space where there is a uniform branching factor b and there is a single goal node at depth m. What is the minimum number of nodes expanded and the storage needed for BFS and DFS? Hint: this question asks about the best case performance of BFS and DFS. 2 ...

View
Full
Document