Bishops on a chessboard
Source: MEMO 2023 T3
August 25, 2023
combinatorics
Problem Statement
Find the smallest integer with the following property: For each way of colouring exactly squares of an chessboard green, one can place bishops on green squares so that no two bishops attack each other.