Problem

Source: Swiss TST 2015. Problem 1

Tags: combinatorics, Chessboard



What is the maximum number of 1 × 1 boxes that can be colored black in a n × n chessboard so that any 2 × 2 square contains a maximum of 2 black boxes?