I have a problem tiling a rectangle with T tetrominoes. I can prove that 4n x 4m rectangles can be tiled.How can I prove that only these rectangles can be tiled with T tetrominoes?
Asked
Active
Viewed 55 times
1
-
1If you can tile a 4 x 4 region, you can tile a 4n x 4m region. The more interesting part of the problem is proving that if it isn't 4n x 4m, it can't be tiled with Ts/ – Rushabh Mehta May 01 '19 at 13:55
-
1See for example https://mathoverflow.net/questions/28883/what-can-be-tiled-by-t-tetrominoes . This is not an easy problem. – Michael Lugo May 01 '19 at 14:19
-
Yes its the main problem @DonThousand – Liana May 01 '19 at 19:28
-
I read paper, it defines a chain graph and height function, but I didn't see the clear proof of this claim @MichaelLugo – Liana May 01 '19 at 19:32
-
@Liana Take some time to read through papers. You can't expect to digest them instantaneously. – Rushabh Mehta May 01 '19 at 19:55
-
thanks @DonThousand – Liana May 01 '19 at 20:21