Dynamic Programming21 sections · 916 units
Open in Course

Tri Tiling - Small Cases

Manual enumeration

For n=2n = 2, there are exactly 33 ways: all horizontal in each row, two vertical pairs, or a mix. For n=4n = 4, you get 1111 ways. These numbers hint at a pattern.

Notice that nn must be even. With an odd nn, you have 3n3n cells (odd total), but each domino covers 22 cells. You can't tile an odd number of cells with dominoes. The sequence 3,11,41,153,3, 11, 41, 153, \ldots follows a pattern where each term depends on previous terms. Can you see it? Each new term relates to previous terms in a specific way.