Four Color Map Problem

Four Color Map Problem is a 1-player puzzle for the TRS-80.

In mathematics, 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.

In this puzzle, the player attempts to fill in a map containing different sized and spaced squares with 4 separate colors, so that no two contiguous squares are the same color. There are three difficulties of maps available.