News for hackers. Stuff that matters.
Re:The 17x17 challenge. "Worth $289.00. This is not a joke." by cperciva on Monday November 30, 2009 @04:47PM (#968770)
The 4 colour theorem is about colouring an arbitrary planar graph such that adjacent vertices have different colours.

The problem posed here is about colouring a 17x17 grid such that there is no monochromatic rectangle.

These problems have nothing in common aside from the word "colouring" and the number "4".

There are no comments on this comment yet.