Four Color Theorem

In mathematics, the four color theorem, or the four color map theorem, states that, given any separation of a plane into contiguous regions, producing a figure called a map, no more than four colors are required to color the regions of the map so that no two adjacent regions have the same color. The goal of this game is to color the entire map so that two adjacent regions do not have the same color. Each level has a predefined “par”, or optimal number of color to pass it. Target that par to get a star. Also, I don’t want the game to be too frustrating, so, passing the level with one color above the par is ok.