Tilings of 1 by n Chessboards Using Squares, Dominos, and Triominos

The Fibonacci numbers count the number of tilings of a chessboard using squares and dominos. This Demonstration allows you to explore those tilings, along with tilings that permit the use of triominos. All tilings for chessboards up to length 10 are included, and can be viewed individually. Furthermore, tilings for several consecutive small can be viewed simultaneously to aid in the understanding of the relevant recurrence relations.

Contributed by: Marc Brodie (Wheeling Jesuit University)