POLYOMINO TILINGS

Polyomino Tilings

Select polyominoes for a set (currently 1 or 2), for which tilings should be shown.

Then click "Show" button.

You may also see list of all polyomino sets for which data is available here.


I tetromino and T1 hexomino

Prime rectangles: ≥ 5.

Smallest rectangle tilings

Smallest rectangle (4x5):

Smallest square (8x8):

Rectangle tilings' solutions count (including symmetric)

Blue number (P) - strongly prime rectangle (which cannot be divided into two or more number of rectangles tileable by this set).

Green number (W) - weakly prime rectangle (which cannot be divided into two rectangles tileable by this set, but which can be divided into three or more rectangles).

Red number (C) - composite rectangle (which can be divided into two rectangles tileable by this set).

Gray number - it is unknown whether rectangle is prime or composite.

Question mark (?) - solution count is unknown.

Click on underlined numbers to view picture with one solution.

w \ h1-345678N>0
1-30
4000
5022P00
6044P0000
7066P000000
8088P4646C100100C180180C602602C
901616P00000029882988C?
1003232C000000≥1≥1C?
1105656C000000≥1≥1C?
1208888C586586C16321632C40604060C≥1≥1Call
130140140C000000≥1≥1C?
140236236C000000≥1≥1C?
150402402C000000≥1≥1C?
160664664C66346634C2449624496C8855288552C≥1≥1Call
N>0xall???all

Smallest common multiples

Smallest common multiple (area 24):

Smallest known common multiple without holes (area 36):

Smallest known convex common multiple (area 48):

Common multiples' solutions count (excluding symmetric)

area12243648
solutions?≥2≥1≥1

Attributions

  1. Smallest rectangle and square found by Dmitry Grekov
  2. Solutions counted by Dmitry Grekov
  3. Smallest common multiple found by Jorge Mireles
  4. Holeless common multiple found by Dmitry Grekov
  5. Convex common multiple found by Dmitry Grekov

See Also

I tetromino and G hexominoI tetromino and X2 hexomino