This is a picture of an staircase polyomino tiled by 10 straight polyominos from a set of size 1 through 4.
What is the minimum number of straight polyominoes from a set of size 1 through 12 required to tile an staircase polyomino?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
1 0 0 / 1 2 = 8 r 4 which means if we fill the longest 5 rows with 8 copies each it will leave a copy of the n=4 staircase that will be filled by 4 small straights. Pieces used: 8 ∗ 5 + 4 = 4 4 and rows 100 to 96 filled.
The next 12 rows can be filled by 7 copies leaving a n=11 staircase that will be filled by 1 1 straights. Pieces used: 1 2 ∗ 7 + 1 1 = 9 5 Rows to 84 filled.
The next 12 rows can be filled by 6 copies leaving a n=11 staircase that will be filled by 1 1 straights. Pieces used 1 2 ∗ 6 + 1 1 = 8 3 Rows to 72 filled. Continuing
1 2 ∗ 5 + 1 1 = 7 1 will fill to row 60
1 2 ∗ 4 + 1 1 = 5 9 will fill to row 48
1 2 ∗ 3 + 1 1 = 4 7 will fill to row 36
1 2 ∗ 2 + 1 1 = 3 5 will fill to row 24
1 2 ∗ 1 + 1 1 = 2 3 will fill to row 12
1 2 ∗ 0 + 1 1 = 1 1 will fill the final 11 rows.
Total = 4 4 + 1 2 ∗ ( 7 + 6 + 5 + 4 + 3 + 2 + 1 + 0 ) + 1 1 ∗ 8 = 4 6 8