Scribd
Upload
91 views3 pages

Assignment 1 Notes - MDFD

The document discusses tiling chessboards with dominoes. It asks the reader to: 1) Count the number of perfect tilings for various sized 2xN and 3xN chessboards. Perfect tilings require the entire board is covered without overlaps. 2) Consider generalizing the results to find a formula for tilings of m×n chessboards and explore what sizes allow perfect tilings. 3) Determine if a 62 square board with a diagonal removed can be perfectly tiled and count the tilings of a 2x2x2 block using 2x1x1 blocks.

Uploaded by

nicole1003
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
91 views3 pages

Assignment 1 Notes - MDFD

The document discusses tiling chessboards with dominoes. It asks the reader to: 1) Count the number of perfect tilings for various sized 2xN and 3xN chessboards. Perfect tilings require the entire board is covered without overlaps. 2) Consider generalizing the results to find a formula for tilings of m×n chessboards and explore what sizes allow perfect tilings. 3) Determine if a 62 square board with a diagonal removed can be perfectly tiled and count the tilings of a 2x2x2 block using 2x1x1 blocks.

Uploaded by

nicole1003
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

1 MGM 503 : Combinatorics Notes for Assignment 1: Chessboard Combinatorics A perfect cover (also called a tiling) of an m by n chess board

by tiles (usually dominoes) is an arrangement so that (i) the entire board is covered, (ii) each tile covers a whole number of squares and (iii) there is no overlap except along the edges. 1. Count the number of perfect covers of the chess boards listed below. (a) 21, 22, 23, 24, 25, and 26.

21

22

23

24

..

25

..

26

2 More generally, let Gn denote the number of tilings of a 2 n board. Find Gn for n = 1, 2, 3, . . . , 10. (b) 3 3, 3 4, 3 5, and 3 6. 33

etc. ? ?

There is no perfect cover. We will always be left with one uncovered square. 34

There are 11 perfect covers for the 3 4 chessboard. Notice that the first 9 tilings arise from 2 perfect covers of the 2 3 chessboard that we had earlier. Then we have two more with two horizontal dominoes in the middle columns. 35 ? ? Again, there is no perfect cover for the 3 5 chessboard. etc.

3 36

Can we see quickly which 3 n chessboard has perfect cover, say for n = 1, 2, 3, , 10? For those 3 n chessboards that have Hn tilings, what is the formula to calculate Hn? Can we further generalize to the perfect tilings of an m n chessboard?

(c) The 62 square board obtained by removing the opposite ends of one of the diagonals.

Can we have a perfect cover?

2. Generalize the definition of tiling to include solid blocks. Find the number of tilings of a 2 2 2 block by blocks of size 2 1 1.

You might also like