On the board tromino-tiles of the shape have to be placed in such a way that each tile covers exactly three cells of the board and the tiles cannot overlap.
What is the least possible number of tromino-tiles that one can place on the board so that no additional tromino-tile can be placed afterwards?
Croatia Mathematical Competitions
Solution
Let us divide the board into 16 squares as in the picture.
In each of those squares at least two cells have to be covered, otherwise we could place a tromino-tile on three uncovered cells. Hence, at least 32 cells have to be covered, and we need at least 11 tromino-tiles to do that covering.
The following construction shows that 11 tromino-tiles are enough to satisfy conditions of the problem.
Want a route through all this instead of an archive? The track
puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.