Imagine you have a cutout from a piece of squared paper and a pile of dominoes, each of which can cover exactly two squares of the squared paper. How many different ways are there to cover the entire paper cutout with dominoes?

One specific paper cutout can be mathematically described as the so-called Aztec Diamond, and a way to cover it with dominoes is a domino tiling.

In this snapshot we revisit some of the seminal combinatorial ideas used to enumerate the number of domino tilings of the Aztec Diamond. The existing connection with the study of the so-called alternating-sign matrices is also explored.