RU-SPB 2015 Problem 102
The beaver is chess piece that move to cells by horizontal or vertical. Every cell of 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?
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.