Problem #PRU-97823

Problems Fun Problems Word Problems Tables and tournaments Chessboards and chess pieces Methods Examples and counterexamples. Constructive proofs Discrete Mathematics Combinatorics Painting problems

Problem

Given an endless piece of chequered paper with a cell side equal to one. The distance between two cells is the length of the shortest path parallel to cell lines from one cell to the other (it is considered the path of the center of a rook). What is the smallest number of colors to paint the board (each cell is painted with one color), so that two cells, located at a distance of 6, are always painted with different colors?