Re:The 17x17 challenge. "Worth $289.00. This is not a joke."
by nollidge on Monday November 30, 2009 @04:48PM
(#968773)
That's not the same problem. This refers to a grid (not a map) of colored points (not regions), colored with 4 colors (at least in this case) in which a rectangle with four same-colored points cannot be found.
[ Parent
| on HN ]
Re:The 17x17 challenge. "Worth $289.00. This is not a joke."
by Dove on Monday November 30, 2009 @04:52PM
(#968781)
Note that the second distinction you made is actually trivial. Coloring the vertices of a planar graph is the same problem as coloring the regions of a different planar graph. The graphs are duals:
http://en.wikipedia.org/wiki/Dual_graph
In this case, the dual of a grid is a grid. So at least that part of it would be the same problem. The other distinctions are true, though.