Problem

Source: Caucasus 2015 7.5

Tags: combinatorics, combinatorial geometry, square grid



What is the smallest number of $3$-cell corners needed to be painted in a $6\times 6$ square so that it was impossible to paint more than one corner of it? (The painted corners should not overlap.)