Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I read that among the 24 heptiamonds there is one piece that does not tile the Euclidean plane. My question is the following, given a particular polyiamond how do you prove that the piece does tile the Euclidean plane? ( I thought about arranging the pieces and possibly stretching the piece to a form of which it is known that it tiles the plane, i.e. triangle, square, parallelogram or hexagon. )

share|cite|improve this question
up vote 1 down vote accepted

The V heptiamond will not tile the plane. All others will.

The proof of tiling is usually to find a tiling. That's often very simple for the smaller iamonds, polyhexes, and polyominoes.

For larger polyforms, such as the wheelbarrow polyhex, finding the tiling can be quite tricky. See the tiling database for more.

share|cite|improve this answer
Can you be more precise about when a tiling has been found. What is the exact criterium for that? Imagine an algorithm doing so, what would be the stop rule? – nilo de roock Jan 23 '14 at 10:35
Octiamond tilings -- When a repeated tiling with translation is found, you've divided the plane into identical cells with identical orientation. Each cell will have some number of of polyforms. – Ed Pegg Jan 23 '14 at 14:27
That's a nice page, there is one about the heptiamonds too. Anyway, I had hoped that there was a way to a priori say, from its properties, that the V-shape does not tile the plane. – nilo de roock Jan 23 '14 at 15:07
With the V shape, lay down one. To fill the hole, the next piece is forced. To fill that hole, the next move is forced. A few more forced moves gives unfillable holes. Generally, the non-tilers cannot surround themselves, the Heesch problem, but there are many non-tilers that are Heesch-2. – Ed Pegg Jan 23 '14 at 17:22

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.