Note that the second distinction you made is actually trivial. Coloring the vert... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		Dove on Nov 30, 2009 \| parent \| context \| favorite \| on: The 17x17 challenge. "Worth $289.00. This is not a... 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.

nollidge on Nov 30, 2009 [–]

Of course you are right. I guess I pictured the 17x17=289 points forming 16x16=256 squares, which is why I felt it necessary to make the distinction.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact