MathDB
Chessboard coloring

Source: St Petersburg Olympiad 2015, Grade 10, P2

October 17, 2017
combinatorics

Problem Statement

The beaver is chess piece that move to 22 cells by horizontal or vertical. Every cell of 100×100100 \times 100 chessboard colored in some color,such that we can not get from one cell to another with same color with one move of beaver or knight. What minimal color do we need?