Problem

Source:

Tags: combinatorics, tiles



A triminĂ³ is a rectangular tile of $1\times 3$. Is it possible to cover a $8\times8$ chessboard using $21$ triminĂ³s, in such a way there remains exactly one $1\times 1$ square without covering? In case the answer is in the affirmative, determine all the possible locations of such a unit square in the chessboard.