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 topdown, problem reduction goal tree. b. The Traveling Salesman problem with 5 cities I would use a search tree. c. The mapcoloring 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
 JasonLitz
 Freeway, Travelling salesman problem, NPcomplete, Timothy Martens, Bob Cars

Click to edit the document details