Technicolor Dream Map

Clare has a project in school where she has to design a map of the United States. The only stipulation to the project is that no two adjoining states can be the same color. What is the least amount of colors Clare needs to accomplish this?

Share:

• Click to email a link to a friend (Opens in new window)
• Click to print (Opens in new window)
• Click to share on Facebook (Opens in new window)
• Click to share on LinkedIn (Opens in new window)
• Click to share on Reddit (Opens in new window)
• Click to share on Twitter (Opens in new window)
• Click to share on Tumblr (Opens in new window)
• Click to share on Pinterest (Opens in new window)

July 1st, 2012 | Category: Brain Riddle, Geography |  Email This Riddle

3 guesses to Technicolor Dream Map

Warning: Use of undefined constant bfa_comments - assumed 'bfa_comments' (this will throw an Error in a future version of PHP) in /home/customer/www/riddledude.com/public_html/wp-content/themes/atahualpa/comments.php on line 132

• Boesner

  July 2, 2012 at 9:54 PM

  4

• Dude

  July 3, 2012 at 10:00 PM

  Four is correct, Boesner.

  The answer is only four. The famous Four Color Theorem states that any planar graph can be colored with at most four colors.

  For more information, visit: http://en.wikipedia.org/wiki/Four_color_theorem

  You’re today’s winner.

• Brooke

  April 27, 2017 at 8:30 AM

  How did Boesner figure that out? Good job dude! Here’s another map riddle but its tricky, if you can figure it out let me know: Where Am I Located