Problem

Source: Baltic Way 2014, Problem 9

Tags: combinatorics proposed, combinatorics



What is the least posssible number of cells that can be marked on an $n \times n$ board such that for each $m >\frac{ n}{2}$ both diagonals of any $m \times m$ sub-board contain a marked cell?