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.
Problem
Source:
Tags: combinatorics, tiles
19.06.2019 19:10
\begin{tabular}{ | c | c | c | c | c | c | c | c |} \hline 1 & 2 & 3 & 1 & 2 & 3 & 1 & 2\\ \hline 1 & 2 & 3 & 1 & 2 & 3 & 1 & 2\\ \hline 1 & 2 & 3 & 1 & 2 & 3 & 1 & 2\\ \hline 1 & 2 & 3 & 1 & 2 & 3 & 1 & 2\\ \hline 1 & 2 & 3 & 1 & 2 & 3 & 1 & 2\\ \hline 1 & 2 & 3 & 1 & 2 & 3 & 1 & 2\\ \hline 1 & 2 & 3 & 1 & 2 & 3 & 1 & 2\\ \hline 1 & 2 & 3 & 1 & 2 & 3 & 1 & 2\\ \hline \end{tabular}As above, when tilling a $1x3$ trimino, the sum of numbers which are hidden is divisible by 3. Because the sum of all above numbers is also divisible by three, the unit square is on 3-collums. We can find its rows by the same way. The rest is giving an example for each one which is your turn
20.06.2019 10:04
you can take this one \begin{tabular}{ | c | c | c | c | c | c | c | c |} \hline a & b & c & a & b & c & a & b\\ \hline b & c & a & b & c & a & b & c\\ \hline c & a & {\bf b} & c & a & {\bf b} & c & a\\ \hline a & b & c & a & b & c & a & b\\ \hline b & c & a & b & c & a & b & c\\ \hline c & a & {\bf b} & c & a & {\bf b} & c & a\\ \hline a & b & c & a & b & c & a & b\\ \hline b & c & a & b & c & a & b & c\\ \hline \end{tabular} just by counting we get that the unit square is located at b-cell, after rotating $90$ degrees you get the same but the only overlaping b's are those marked bold. The rest is providing an example which is trivial.
20.06.2019 14:10
Italy TST 1995