This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: 5. Returning to side 1 he gets the chicken goes to side 2. 6. Done, and everything arrives safely. 3. Provide representations of the following four problems: a. The Towers of Hanoi problem with 4 disks I would use a top-down, problem reduction goal tree. b. The Traveling Salesman problem with 5 cities I would use a search tree. c. The map-coloring problem with 4 countries and 3 colors where we apply the constraint that no 2 adjacent countries can have the same color. I would use a goal tree. It would also be possible to use a search tree and heuristic to find two countries that are not touching each other and color them the same. d....
View Full Document
- Summer '09