Problem

Source: Kyiv mathematical festival 2018

Tags: Kyiv mathematical festival, combinatorics



A square of size $2\times2$ with one of its cells occupied by a tower is called a castle. What maximal number of castles one can place on a board of size $7\times7$ so that the castles have no common cells and all the towers stand on the diagonals of the board?