Consider an infinite grid of unit square cells. A chessboard polygon is a simple polygon (i.e. not self-intersecting) whose sides lie along the gridlines of .
Nikolai chooses a chessboard polygon and challenges you to paint some cells of green, such that any chessboard polygon congruent to has at least green cell but at most green cells. Can Nikolai choose to make your job impossible?
Nikolai Beluhov