MathDB

2

Part of 2015 EGMO

Problems(1)

[EGMO2] Domino tilings

Source: EGMO 2015, Problem 2

4/16/2015
A domino is a 2×12 \times 1 or 1×21 \times 2 tile. Determine in how many ways exactly n2n^2 dominoes can be placed without overlapping on a 2n×2n2n \times 2n chessboard so that every 2×22 \times 2 square contains at least two uncovered unit squares which lie in the same row or column.
combinatoricsEGMOdominoescountingEGMO 2015Hi