Jump to content
BrainDen.com - Brain Teasers
  • 0

Covering perforated hexagon with triminoes



This puzzle is inspired by posted by bonanova.

Again we work on a hexagonal tiling of a plane, and the question is about
possibility of covering some shape with triminoes.
Trimino is a "triangle" formed by three unit hexagons sharing common vertex.

The shape to cover is defined as follows:
Let's pick a unit hexagon and call it H1.
Now we recursively define Hn+1 as a sum of Hn and all unit hexagons adjacent to Hn.
So basically Hn is a "hexagon" with side of length n (unit hexagons).

Let Dn be Hn with one unit hexagon at it's center removed.
So, can you cover D2015 with triminoes?

Edited by rookie1ja
Link to comment
Share on other sites

10 answers to this question

Recommended Posts

  • 0

Wait, I just realized that the question is asking about D(2015), not D(2014). :P

Using my reasoning above (which was not very elegant), D(2015) has an odd number of colors, namely three extra of each color that isn't what the center tile would have been. Thus, a complete tiling is impossible. Yay!

Link to comment
Share on other sites

  • 0

I just saw this puzzle today.


The coloring trick immediately came to mind, but I couldn't figure out how to count the colors...

Just now, I reasoned that you could split any D(n) into six triangle shaped pieces that look like this after coloring (each triangle will only look the same as two others, but the color pattern will be the same for all six):








After the first three rows, the later rows repeat except with some sets of three different colors appended to the end. In other words, the regex for every third row after the first row would be R(GBR)*, the regex for every third row after the second row would be GB(RGB)*, and the regex for every third row after the third row would be BRG(BRG)*.

Since D(n) has a side length of n, the triangles each have n-1 rows. Since the colors repeat, we can just look at the first n-1 (mod 3) rows and count the colors.

From this, I gleaned that there is only an odd number of colors if n (mod 3) = 2. So for D(2014), there is an equal number of each color.

So after all this, all I can say is that it's not necessarily impossible to tile D(2014) with triminoes...

Edited by gavinksong
Link to comment
Share on other sites

Join the conversation

You can post now and register later. If you have an account, sign in now to post with your account.

Answer this question...

×   Pasted as rich text.   Paste as plain text instead

  Only 75 emoji are allowed.

×   Your link has been automatically embedded.   Display as a link instead

×   Your previous content has been restored.   Clear editor

×   You cannot paste images directly. Upload or insert images from URL.


  • Recently Browsing   0 members

    • No registered users viewing this page.
  • Create New...