نص القضية

1999/3. Given an n×n square board with n even. Two distinct squares of the board are said to be adjacent if they share a common side, but a square of not adjacent to itself. Find the minimum number of squares that can be marked so that every square (marked or not) is adjacent to at least one marked square.