
Re: 4 colors problem
Posted:
Mar 9, 2014 9:21 PM


"You would first have to prove that patterns of adjacent skwares would serve to denote any pattern of countries..."
That's where the beauty of countries uniting comes in. First, all the countries start out as equalsized squares. Then, as countries unite and merge with one another, suddenly you see patterns of countries taking on a shape of a realworld map if you want. Or any other shapes and sizes of countries on a map that anyone would care to see. That was the plan, anyway. There won't be any patterns or algorithms to worry about. Computer will play a clueless contestant and mix and match colors to complete the coloring of a given map to the best of its ability. But no matter how haphapzard the mixing and matching of colors, the resulting map will always follow the 4color theorem. The computer will then check to make sure that all the colorings follow the theorem to a T. If not, it will do its best to colorcorrect. Where it cannot, it will declare a defeat. That was the plan, anyway. I don't know if too many people are interested in this too much. That's anybody's guess, I guess...

