|Title:||The world in four colors|
|Keywords:||#Algorithms #Coloring #Constraints|
A mathematical theorem demonstrates that four colors are enough to color any map (without two contiguous regions sharing the same color, of course).
In practice, coloring can be done by hand with patience, or by algorithmic techniques of “logic programming/answer set programming” or “constraint programming”. To compute this map, we used the Clingo solver developed by the University of Potsdam and compiled by Dominik Moritz. Note that some islands remain in gray: since they do not touch any other region, you can assign them any color.