# dominoes

Published articles for dominoes.

This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles.

## Tiling a Chessboard with Dominoes (Opposite Colors Removed)

DevFeed: [Tiling a Chessboard with Dominoes (Opposite Colors Removed)](<https://devfeed.tech/articles/tiling-a-chessboard-with-dominoes-opposite-colors-removed-40248.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/2011/11/18/tiling-a-chessboard-2/>)

Published: 2011-11-18T10:32:54Z

Content type: tutorial

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [Algorithm](<https://devfeed.tech/topics/algorithm.md>)

Tags: [algorithm](<https://devfeed.tech/tags/algorithm.md>), [analysis](<https://devfeed.tech/tags/analysis.md>), [chessboard](<https://devfeed.tech/tags/chessboard.md>), [color](<https://devfeed.tech/tags/color.md>), [dominoes](<https://devfeed.tech/tags/dominoes.md>), [proofs-without-words](<https://devfeed.tech/tags/proofs-without-words.md>), [tiling](<https://devfeed.tech/tags/tiling.md>)

### AI overview

A constructive solution shows that a chessboard with two opposite-colored squares removed can be tiled with 2-by-1 dominoes. The article explains the placement pattern and notes that the corresponding algorithm runs in linear time.

### Source excerpt

This is a natural follow-up to our first gallery entry on the impossibility of tiling certain chessboards with dominoes. Problem: Suppose we remove two squares from a chessboard which have opposite color. Is it possible to tile the remaining squares with 2-by-1 dominoes? Solution: Notice that if we remove two squares of opposite color, then there is only one way to place dominoes on the remaining squares according to this scheme (one cannot tile a domino across the "walls").

## Tiling a Chessboard

DevFeed: [Tiling a Chessboard](<https://devfeed.tech/articles/tiling-a-chessboard-40213.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/2011/06/26/tiling-a-chessboard/>)

Published: 2011-06-26T20:24:09Z

Content type: tutorial

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [color](<https://devfeed.tech/topics/color.md>), [standard](<https://devfeed.tech/topics/standard.md>)

Tags: [chessboard](<https://devfeed.tech/tags/chessboard.md>), [color](<https://devfeed.tech/tags/color.md>), [dominoes](<https://devfeed.tech/tags/dominoes.md>), [mathematics](<https://devfeed.tech/tags/mathematics.md>), [standard](<https://devfeed.tech/tags/standard.md>), [tiling](<https://devfeed.tech/tags/tiling.md>)

### AI overview

The article uses coloring arguments to show that certain chessboard and grid regions cannot be tiled with dominoes. It first analyzes 2-by-1 dominoes on a chessboard with two opposite corners removed, then applies a specially chosen coloring to a 3-by-1 domino problem and generalizes the proof method.

### Source excerpt

Problem: Take a chessboard and cut off two opposite corners. Is it possible to completely tile the remaining board with 2-by-1 dominoes? Solution: Notice that every domino covers exactly one white tile and one black tile. Counting up the colors, we have 32 white and 30 black. Hence, any tiling by 2-by-1 dominoes will leave two extra white squares unaccounted for. So no such tiling is possible. Problem: Cut one corner off a chessboard.