Four color theorem help

So you think you know the multiverse?
JensenBreck
Posts: 65
Joined: Thu Aug 31, 2017 7:12 pm

Four color theorem help

Postby JensenBreck » Fri Oct 13, 2017 2:46 am

I'm a beginner to java programming, only in my second class on it, and we were assigned the four color theorem problem. The four color theorem states that for any region, 4 colors should be able to color it without 2 regions of the same color touching.
The actual problem statement is:
The problem at hand is to take a map separated into regions as expressed in an adjacency matrix and using four colors, color the map such that no two contiguous regions share the same color. We will use an adjacency matrix to encode which region borders on which other region. The columns and rows of the matrix are the regions while the cells contain a 0 if the two regions are not adjacent and a 1 if they border. Create a recursive backtracking solution which accepts an interactive input from the user the number of regions in the map and the filename of the adjacency matrix expressing the maps makeup.

Please help.
Thanks!

I didn't find the right solution from the Internet.

References http://www.javaprogrammingforums.com/al ... -help.html

Animated Product Intro

Return to “Four Color Quizzes”

Who is online

Users browsing this forum: No registered users and 1 guest