Does there exist a method for coloring maps with the least amount of different colors? No two adjacent or touching state can have the same colors. One possible coloring would be to choose eleven different colors and give each state its own color. This is definitely not the minimum amount of colors that could be used. Your job is to devise a method of coloring this map of these eleven states so that you use the minimum number of colors and that no adjacent states use the same color. When you think you have a method that works, write down the steps involved in using your method so that another student can understand your steps and color the map by your method.
Use your set of steps to try your coloring algorithm on the second map below. If it does not work, go back to the original map and steps and modify your method. Try your method on the second map until it works on that one too.
When you are convinced that your method works, exchange your instruction list with a fellow classmate. Try out the other person's method. Form a group with another pair. Discuss your methods. Decide on a method for the entire group and be prepared to share this method with the entire class.