← All problems

Domino Tiling V

Combinatorics · proposed by @vipproaccount 1667
In an $n \times n$ grid, $661$ dominoes are placed so that each domino exactly covers two unit squares (either $2 \times 1$ or $1 \times 2$), and moreover, any two distinct dominoes do not touch each other (they share no common point, not even at a corner). Find the smallest possible value of $n$.