WA1 part 3 - that no 2 adjacent countries can have the same...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
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
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 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

This note was uploaded on 12/30/2009 for the course COS 451 taught by Professor Jasonlitz during the Summer '09 term at Thomas Edison State.

Ask a homework question - tutors are online