MathDB

A domino is a

2 \times 1

1 \times 2

tile. Determine in how many ways exactly

n^2

dominoes can be placed without overlapping on a

2n \times 2n

chessboard so that every

2 \times 2

square contains at least two uncovered unit squares which lie in the same row or column.

Problem Statement