Number of Ways to Tile Standard Chessboard with Dominoes

Theorem

The number of ways to tile a standard chessboard with dominoes is $12 \, 988 \, 816$.

Proof

This theorem requires a proof. In particular: Considerable definition work needed before we can start on this sort of problem. You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{ProofWanted}} from the code. If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page.

Sources

• 1997: David Wells: Curious and Interesting Numbers (2nd ed.) ... (previous) ... (next): $12,988,816$