I saw this four-colored map of U.S. counties in the latest board pack. D-Wave embedded this map-coloring problem into a prototype quantum computer with iterative partitioning.
The four-color theorem states that no more than four colors are needed to color a map such that no adjacent regions have the came color. This proved remarkably difficult to prove, and was the first major theorem to be proved using a computer.
Leave a Reply