Setup and opening position
Six regions form a fixed adjacency graph with several seeded colors. The bounded generator reveals enough region values to remove color-permutation ambiguity and prove one solution.
Map Colouring Puzzle
Color all six regions so every recorded adjacency joins two different colors and all given region colors remain unchanged.
Loading game
Stats on this device
Your unfinished game is saved only in this browser.
- Played
- 0
- Wins
- 0
- Win rate
- —
- Fastest win
- —
- Fewest moves
- —
- Best score
- —
- Current streak
- 0 days
- Best streak
- 0 days
How to play
Color all six regions so every recorded adjacency joins two different colors and all given region colors remain unchanged.
- Six regions form a fixed adjacency graph with several seeded colors. The bounded generator reveals enough region values to remove color-permutation ambiguity and prove one solution.
- Assign color one, two, or three to any unfixed region, or clear an editable choice. Regions connected by an immutable graph edge may never share a color in the completion.
- Color all six regions so every recorded adjacency joins two different colors and all given region colors remain unchanged.
Strategy tips
- Start with a region touching many neighbors and intersect the colors excluded by each fixed neighbor, then propagate forced choices through triangles in the graph.
- Regions that look separated in a simple list may still share an encoded boundary; ignoring one graph edge can produce a visually plausible but invalid coloring.
- When two regions remain, verify their edge to each other as well as their fixed neighbors, because each can have a locally available color that conflicts with the other.
Complete guide
Rules, scoring, and strategy
Map Colouring Puzzle is a complete browser implementation with its own versioned rules profile. Color six labeled regions with three colors so every pair joined by a boundary receives different values while respecting the regions already fixed as clues.
Legal moves and game flow
Assign color one, two, or three to any unfixed region, or clear an editable choice. Regions connected by an immutable graph edge may never share a color in the completion.
Winning and terminal positions
Color all six regions so every recorded adjacency joins two different colors and all given region colors remain unchanged. When two regions remain, verify their edge to each other as well as their fixed neighbors, because each can have a locally available color that conflicts with the other.
Practical strategy
Start with a region touching many neighbors and intersect the colors excluded by each fixed neighbor, then propagate forced choices through triangles in the graph. Regions that look separated in a simple list may still share an encoded boundary; ignoring one graph edge can produce a visually plausible but invalid coloring.
Questions players ask
What is the objective in Map Colouring Puzzle?
Color all six regions so every recorded adjacency joins two different colors and all given region colors remain unchanged.
Which moves are legal in Map Colouring Puzzle?
Assign color one, two, or three to any unfixed region, or clear an editable choice. Regions connected by an immutable graph edge may never share a color in the completion.
What should I plan first in Map Colouring Puzzle?
Start with a region touching many neighbors and intersect the colors excluded by each fixed neighbor, then propagate forced choices through triangles in the graph.