Hard and Easy Instances of L-Tromino Tilings 1
Transcript of Hard and Easy Instances of L-Tromino Tilings 1
![Page 1: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/1.jpg)
Hard and Easy Instances of L-Tromino Tilings 1
Javier T. Akagi 1, Carlos F. Gaona 1, Fabricio Mendoza 1,Manjil P. Saikia 2, Marcos Villagra 1
1Universidad Nacional de AsuncionNIDTEC, Campus Universitario, San Lorenzo C.P. 2619, Paraguay
2Fakultat fur Mathematik, Universitat WienOskar-Morgenstern-Platz 1, 1090 Vienna, Austria
09/01/2019
1arXiv:1710.04640.1/31
![Page 2: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/2.jpg)
Outline
1 IntroductionPolyominoesL-Tromino Tiling Problem
2 Tiling of the Aztec RectanglesAztec RectangleAztec Rectangle with a single defectTiling Aztec Rectangle with unbounded number of defects
3 180-Tromino TilingA rotation constraintForbidden Polyominoes
2/31
![Page 3: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/3.jpg)
Outline
1 IntroductionPolyominoesL-Tromino Tiling Problem
2 Tiling of the Aztec RectanglesAztec RectangleAztec Rectangle with a single defectTiling Aztec Rectangle with unbounded number of defects
3 180-Tromino TilingA rotation constraintForbidden Polyominoes
3/31
![Page 4: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/4.jpg)
Polyominoes
DefinitionA polyomino is a planar figure made from one or more equal-sizedsquares, each joined together along an edge [S. Golomb (1953)].
Every cell (square) is fixed in a square lattice.Two cell are adjacent if the Manhattan distance is 1.
4/31
![Page 5: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/5.jpg)
Polyominoes
DefinitionA polyomino is a planar figure made from one or more equal-sizedsquares, each joined together along an edge [S. Golomb (1953)].
Every cell (square) is fixed in a square lattice.Two cell are adjacent if the Manhattan distance is 1.
4/31
![Page 6: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/6.jpg)
Polyominoes
DefinitionA polyomino is a planar figure made from one or more equal-sizedsquares, each joined together along an edge [S. Golomb (1953)].
Every cell (square) is fixed in a square lattice.Two cell are adjacent if the Manhattan distance is 1.
4/31
![Page 7: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/7.jpg)
Polyominoes
DefinitionA polyomino is a planar figure made from one or more equal-sizedsquares, each joined together along an edge [S. Golomb (1953)].
Every cell (square) is fixed in a square lattice.
Two cell are adjacent if the Manhattan distance is 1.
4/31
![Page 8: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/8.jpg)
Polyominoes
DefinitionA polyomino is a planar figure made from one or more equal-sizedsquares, each joined together along an edge [S. Golomb (1953)].
Every cell (square) is fixed in a square lattice.Two cell are adjacent if the Manhattan distance is 1.
4/31
![Page 9: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/9.jpg)
Outline
1 IntroductionPolyominoesL-Tromino Tiling Problem
2 Tiling of the Aztec RectanglesAztec RectangleAztec Rectangle with a single defectTiling Aztec Rectangle with unbounded number of defects
3 180-Tromino TilingA rotation constraintForbidden Polyominoes
5/31
![Page 10: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/10.jpg)
L-Tromino Tiling Problem
DefinitionGiven:
A set of L-trominoes Σ called a tile set, Σ = { , , ,
}and a polyomino R called region.
Goal: Place tiles from Σ to fill the region R covering every cellwithout overflowing the perimeter of R and without overlappingbetween the tiles.
(a) A region R (b) A tiling of region R
6/31
![Page 11: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/11.jpg)
L-Tromino Tiling Problem
Definition
Given:
A set of L-trominoes Σ called a tile set, Σ = { , , ,
}and a polyomino R called region.
Goal: Place tiles from Σ to fill the region R covering every cellwithout overflowing the perimeter of R and without overlappingbetween the tiles.
(a) A region R (b) A tiling of region R
6/31
![Page 12: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/12.jpg)
L-Tromino Tiling Problem
DefinitionGiven:
A set of L-trominoes Σ called a tile set, Σ = { , , ,
}
and a polyomino R called region.Goal: Place tiles from Σ to fill the region R covering every cellwithout overflowing the perimeter of R and without overlappingbetween the tiles.
(a) A region R (b) A tiling of region R
6/31
![Page 13: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/13.jpg)
L-Tromino Tiling Problem
DefinitionGiven:
A set of L-trominoes Σ called a tile set, Σ = { , , ,
}and a polyomino R called region.
Goal: Place tiles from Σ to fill the region R covering every cellwithout overflowing the perimeter of R and without overlappingbetween the tiles.
(a) A region R (b) A tiling of region R
6/31
![Page 14: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/14.jpg)
L-Tromino Tiling Problem
DefinitionGiven:
A set of L-trominoes Σ called a tile set, Σ = { , , ,
}and a polyomino R called region.
Goal: Place tiles from Σ to fill the region R covering every cellwithout overflowing the perimeter of R and without overlappingbetween the tiles.
(a) A region R (b) A tiling of region R
6/31
![Page 15: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/15.jpg)
L-Tromino Tiling Problem
DefinitionGiven:
A set of L-trominoes Σ called a tile set, Σ = { , , ,
}and a polyomino R called region.
Goal: Place tiles from Σ to fill the region R covering every cellwithout overflowing the perimeter of R and without overlappingbetween the tiles.
(a) A region R (b) A tiling of region R
6/31
![Page 16: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/16.jpg)
L-Tromino Tiling Problem (cont’d)
C. Moore and J. M. Robson (2000) proved that deciding theexistence of a L-tromino tiling in a given region isNP-complete with a reduction from Monotone 1-in-3 SAT.
T. Horiyama, T. Ito, K. Nakatsuka, A. Suzuki and R. Uehara(2012) constructed a one-one reduction from 1-in-3 SAT.
7/31
![Page 17: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/17.jpg)
L-Tromino Tiling Problem (cont’d)
C. Moore and J. M. Robson (2000) proved that deciding theexistence of a L-tromino tiling in a given region isNP-complete with a reduction from Monotone 1-in-3 SAT.
T. Horiyama, T. Ito, K. Nakatsuka, A. Suzuki and R. Uehara(2012) constructed a one-one reduction from 1-in-3 SAT.
7/31
![Page 18: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/18.jpg)
L-Tromino Tiling Problem (cont’d)
C. Moore and J. M. Robson (2000) proved that deciding theexistence of a L-tromino tiling in a given region isNP-complete with a reduction from Monotone 1-in-3 SAT.
T. Horiyama, T. Ito, K. Nakatsuka, A. Suzuki and R. Uehara(2012) constructed a one-one reduction from 1-in-3 SAT.
7/31
![Page 19: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/19.jpg)
Outline
1 IntroductionPolyominoesL-Tromino Tiling Problem
2 Tiling of the Aztec RectanglesAztec RectangleAztec Rectangle with a single defectTiling Aztec Rectangle with unbounded number of defects
3 180-Tromino TilingA rotation constraintForbidden Polyominoes
8/31
![Page 20: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/20.jpg)
Aztec Rectangle
The Aztec Diamond AD(n) is the union of all cell inside thecontour |x | + |y | = n + 1.
(a) AD(1) (b) AD(2) (c) AD(3) (d) AD(4)
The Aztec Rectangle ARa,b is a generalization of an Aztec Diamond.
(a) AR1,2 (b) AR1,3 (c) AR2,3 (d) AR3,4
9/31
![Page 21: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/21.jpg)
Aztec RectangleThe Aztec Diamond AD(n) is the union of all cell inside thecontour |x | + |y | = n + 1.
(a) AD(1) (b) AD(2) (c) AD(3) (d) AD(4)
The Aztec Rectangle ARa,b is a generalization of an Aztec Diamond.
(a) AR1,2 (b) AR1,3 (c) AR2,3 (d) AR3,4
9/31
![Page 22: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/22.jpg)
Aztec RectangleThe Aztec Diamond AD(n) is the union of all cell inside thecontour |x | + |y | = n + 1.
(a) AD(1) (b) AD(2) (c) AD(3) (d) AD(4)
The Aztec Rectangle ARa,b is a generalization of an Aztec Diamond.
(a) AR1,2 (b) AR1,3 (c) AR2,3 (d) AR3,4
9/31
![Page 23: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/23.jpg)
Aztec RectangleThe Aztec Diamond AD(n) is the union of all cell inside thecontour |x | + |y | = n + 1.
(a) AD(1) (b) AD(2) (c) AD(3) (d) AD(4)
The Aztec Rectangle ARa,b is a generalization of an Aztec Diamond.
(a) AR1,2 (b) AR1,3 (c) AR2,3 (d) AR3,4
9/31
![Page 24: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/24.jpg)
Aztec RectangleThe Aztec Diamond AD(n) is the union of all cell inside thecontour |x | + |y | = n + 1.
(a) AD(1) (b) AD(2) (c) AD(3) (d) AD(4)
The Aztec Rectangle ARa,b is a generalization of an Aztec Diamond.
(a) AR1,2 (b) AR1,3 (c) AR2,3 (d) AR3,4
9/31
![Page 25: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/25.jpg)
Tiling Aztec Rectangle (cont’d)
Each piece of L-tromino covers 3 cells.
In any L-tromino tiling, the number of covered cells is alwaysmultiple of 3.
The number of cells in an ARa,b is given by
|ARa,b| = a(b + 1) + b(a + 1).
TheoremAn Aztec rectangle ARa,b has a tiling with L-trominoes⇐⇒ |ARa,b| ≡ 0 (mod 3)⇐⇒
(a, b) is equal to (3k, 3k ′) or (3k − 1, 3k ′ − 1) for some k, k ′ ∈ N.
10/31
![Page 26: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/26.jpg)
Tiling Aztec Rectangle (cont’d)Each piece of L-tromino covers 3 cells.
In any L-tromino tiling, the number of covered cells is alwaysmultiple of 3.
The number of cells in an ARa,b is given by
|ARa,b| = a(b + 1) + b(a + 1).
TheoremAn Aztec rectangle ARa,b has a tiling with L-trominoes⇐⇒ |ARa,b| ≡ 0 (mod 3)⇐⇒
(a, b) is equal to (3k, 3k ′) or (3k − 1, 3k ′ − 1) for some k, k ′ ∈ N.
10/31
![Page 27: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/27.jpg)
Tiling Aztec Rectangle (cont’d)Each piece of L-tromino covers 3 cells.
In any L-tromino tiling, the number of covered cells is alwaysmultiple of 3.
The number of cells in an ARa,b is given by
|ARa,b| = a(b + 1) + b(a + 1).
TheoremAn Aztec rectangle ARa,b has a tiling with L-trominoes⇐⇒ |ARa,b| ≡ 0 (mod 3)⇐⇒
(a, b) is equal to (3k, 3k ′) or (3k − 1, 3k ′ − 1) for some k, k ′ ∈ N.
10/31
![Page 28: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/28.jpg)
Tiling Aztec Rectangle (cont’d)Each piece of L-tromino covers 3 cells.
In any L-tromino tiling, the number of covered cells is alwaysmultiple of 3.
The number of cells in an ARa,b is given by
|ARa,b| = a(b + 1) + b(a + 1).
TheoremAn Aztec rectangle ARa,b has a tiling with L-trominoes⇐⇒ |ARa,b| ≡ 0 (mod 3)⇐⇒
(a, b) is equal to (3k, 3k ′) or (3k − 1, 3k ′ − 1) for some k, k ′ ∈ N.
10/31
![Page 29: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/29.jpg)
Tiling Aztec Rectangle (cont’d)Each piece of L-tromino covers 3 cells.
In any L-tromino tiling, the number of covered cells is alwaysmultiple of 3.
The number of cells in an ARa,b is given by
|ARa,b| = a(b + 1) + b(a + 1).
TheoremAn Aztec rectangle ARa,b has a tiling with L-trominoes⇐⇒ |ARa,b| ≡ 0 (mod 3)⇐⇒
(a, b) is equal to (3k, 3k ′) or (3k − 1, 3k ′ − 1) for some k, k ′ ∈ N.
10/31
![Page 30: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/30.jpg)
Tiling Aztec Rectangle (cont’d)Each piece of L-tromino covers 3 cells.
In any L-tromino tiling, the number of covered cells is alwaysmultiple of 3.
The number of cells in an ARa,b is given by
|ARa,b| = a(b + 1) + b(a + 1).
TheoremAn Aztec rectangle ARa,b has a tiling with L-trominoes⇐⇒ |ARa,b| ≡ 0 (mod 3)⇐⇒ (a, b) is equal to (3k, 3k ′) or (3k − 1, 3k ′ − 1) for some k, k ′ ∈ N.
10/31
![Page 31: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/31.jpg)
Tiling Aztec Rectangle (cont’d)
The problem of tiling an Aztec Rectangle can be solved recursively.If (a, b) equals (3k, 3k ′), use pattern 1.If (a, b) equals (3k − 1, 3k ′ − 1), use pattern 2.
ARa,b
ARa+2,b+2
(a) Pattern 1
ARa,b
ARa+4,b+4
(b) Pattern 2
11/31
![Page 32: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/32.jpg)
Tiling Aztec Rectangle (cont’d)The problem of tiling an Aztec Rectangle can be solved recursively.
If (a, b) equals (3k, 3k ′), use pattern 1.If (a, b) equals (3k − 1, 3k ′ − 1), use pattern 2.
ARa,b
ARa+2,b+2
(a) Pattern 1
ARa,b
ARa+4,b+4
(b) Pattern 2
11/31
![Page 33: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/33.jpg)
Tiling Aztec Rectangle (cont’d)The problem of tiling an Aztec Rectangle can be solved recursively.
If (a, b) equals (3k, 3k ′), use pattern 1.If (a, b) equals (3k − 1, 3k ′ − 1), use pattern 2.
ARa,b
ARa+2,b+2
(a) Pattern 1
ARa,b
ARa+4,b+4
(b) Pattern 2
11/31
![Page 34: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/34.jpg)
Tiling Aztec Rectangle (cont’d)The problem of tiling an Aztec Rectangle can be solved recursively.
If (a, b) equals (3k, 3k ′), use pattern 1.If (a, b) equals (3k − 1, 3k ′ − 1), use pattern 2.
ARa,b
ARa+2,b+2
(a) Pattern 1
ARa,b
ARa+4,b+4
(b) Pattern 2
11/31
![Page 35: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/35.jpg)
Tiling Aztec Rectangle (cont’d)The problem of tiling an Aztec Rectangle can be solved recursively.
If (a, b) equals (3k, 3k ′), use pattern 1.If (a, b) equals (3k − 1, 3k ′ − 1), use pattern 2.
ARa,b
ARa+2,b+2
(a) Pattern 1
ARa,b
ARa+4,b+4
(b) Pattern 2
11/31
![Page 36: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/36.jpg)
Tiling Aztec Rectangle (cont’d)The problem of tiling an Aztec Rectangle can be solved recursively.
If (a, b) equals (3, 3k ′), use pattern 3.If (a, b) equals (2, 3k ′ − 1), use pattern 4.
AR3,b
AR3,b+3
(a) Pattern 3
AR2,b
AR2,b+3
(b) Pattern 4
Base case: AR2,2 and AR3,3.
AR2,2
AR3,3
12/31
![Page 37: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/37.jpg)
Tiling Aztec Rectangle (cont’d)The problem of tiling an Aztec Rectangle can be solved recursively.
If (a, b) equals (3, 3k ′), use pattern 3.If (a, b) equals (2, 3k ′ − 1), use pattern 4.
AR3,b
AR3,b+3
(a) Pattern 3
AR2,b
AR2,b+3
(b) Pattern 4
Base case: AR2,2 and AR3,3.
AR2,2
AR3,3
12/31
![Page 38: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/38.jpg)
Tiling Aztec Rectangle (cont’d)The problem of tiling an Aztec Rectangle can be solved recursively.
If (a, b) equals (3, 3k ′), use pattern 3.If (a, b) equals (2, 3k ′ − 1), use pattern 4.
AR3,b
AR3,b+3
(a) Pattern 3
AR2,b
AR2,b+3
(b) Pattern 4
Base case: AR2,2 and AR3,3.
AR2,2
AR3,3
12/31
![Page 39: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/39.jpg)
Tiling Aztec Rectangle (cont’d)The problem of tiling an Aztec Rectangle can be solved recursively.
If (a, b) equals (3, 3k ′), use pattern 3.If (a, b) equals (2, 3k ′ − 1), use pattern 4.
AR3,b
AR3,b+3
(a) Pattern 3
AR2,b
AR2,b+3
(b) Pattern 4
Base case: AR2,2 and AR3,3.
AR2,2
AR3,3
12/31
![Page 40: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/40.jpg)
Tiling Aztec Rectangle (cont’d)The problem of tiling an Aztec Rectangle can be solved recursively.
If (a, b) equals (3, 3k ′), use pattern 3.If (a, b) equals (2, 3k ′ − 1), use pattern 4.
AR3,b
AR3,b+3
(a) Pattern 3
AR2,b
AR2,b+3
(b) Pattern 4
Base case: AR2,2 and AR3,3.
AR2,2
AR3,3
12/31
![Page 41: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/41.jpg)
Tiling Aztec Rectangle (cont’d)The problem of tiling an Aztec Rectangle can be solved recursively.
If (a, b) equals (3, 3k ′), use pattern 3.If (a, b) equals (2, 3k ′ − 1), use pattern 4.
AR3,b
AR3,b+3
(a) Pattern 3
AR2,b
AR2,b+3
(b) Pattern 4
Base case: AR2,2 and AR3,3.
AR2,2
AR3,3
12/31
![Page 42: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/42.jpg)
Outline
1 IntroductionPolyominoesL-Tromino Tiling Problem
2 Tiling of the Aztec RectanglesAztec RectangleAztec Rectangle with a single defectTiling Aztec Rectangle with unbounded number of defects
3 180-Tromino TilingA rotation constraintForbidden Polyominoes
13/31
![Page 43: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/43.jpg)
Tiling Aztec Rectangle with a single defect
A defect cell is a cell in which no tromino can be placed on top.
defect cell
Theorem
An Aztec rectangle ARa,b with one defect has a tiling with L-trominoes
⇐⇒ |ARa,b| ≡ 1 (mod 3)⇐⇒ a or b is equal to 3k − 2 for some k ∈ N.
14/31
![Page 44: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/44.jpg)
Tiling Aztec Rectangle with a single defectA defect cell is a cell in which no tromino can be placed on top.
defect cell
Theorem
An Aztec rectangle ARa,b with one defect has a tiling with L-trominoes
⇐⇒ |ARa,b| ≡ 1 (mod 3)⇐⇒ a or b is equal to 3k − 2 for some k ∈ N.
14/31
![Page 45: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/45.jpg)
Tiling Aztec Rectangle with a single defectA defect cell is a cell in which no tromino can be placed on top.
defect cell
Theorem
An Aztec rectangle ARa,b with one defect has a tiling with L-trominoes
⇐⇒ |ARa,b| ≡ 1 (mod 3)⇐⇒ a or b is equal to 3k − 2 for some k ∈ N.
14/31
![Page 46: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/46.jpg)
Tiling Aztec Rectangle with a single defectA defect cell is a cell in which no tromino can be placed on top.
defect cell
TheoremAn Aztec rectangle ARa,b with one defect has a tiling with L-trominoes⇐⇒ |ARa,b| ≡ 1 (mod 3)⇐⇒ a or b is equal to 3k − 2 for some k ∈ N.
14/31
![Page 47: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/47.jpg)
Tiling Aztec Rectangle with a single defect (cont’d)
Place a fringe where it covers the defect.Place stairs to cover other cells.
15/31
![Page 48: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/48.jpg)
Tiling Aztec Rectangle with a single defect (cont’d)
Place a fringe where it covers the defect.
Place stairs to cover other cells.
15/31
![Page 49: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/49.jpg)
Tiling Aztec Rectangle with a single defect (cont’d)
Place a fringe where it covers the defect.
Place stairs to cover other cells.
fringe
15/31
![Page 50: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/50.jpg)
Tiling Aztec Rectangle with a single defect (cont’d)
Place a fringe where it covers the defect.
Place stairs to cover other cells.
fringe
15/31
![Page 51: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/51.jpg)
Tiling Aztec Rectangle with a single defect (cont’d)
Place a fringe where it covers the defect.
Place stairs to cover other cells.
fringe
15/31
![Page 52: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/52.jpg)
Tiling Aztec Rectangle with a single defect (cont’d)
Place a fringe where it covers the defect.
Place stairs to cover other cells.
fringe
15/31
![Page 53: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/53.jpg)
Tiling Aztec Rectangle with a single defect (cont’d)
Place a fringe where it covers the defect.
Place stairs to cover other cells.
fringe
15/31
![Page 54: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/54.jpg)
Tiling Aztec Rectangle with a single defect (cont’d)
Place a fringe where it covers the defect.
Place stairs to cover other cells.
fringe
15/31
![Page 55: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/55.jpg)
Tiling Aztec Rectangle with a single defect (cont’d)
Place a fringe where it covers the defect.Place stairs to cover other cells.
fringe
15/31
![Page 56: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/56.jpg)
Tiling Aztec Rectangle with a single defect (cont’d)
Place a fringe where it covers the defect.Place stairs to cover other cells.
fringe
stairs
15/31
![Page 57: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/57.jpg)
Tiling Aztec Rectangle with a single defect (cont’d)
Place a fringe where it covers the defect.Place stairs to cover other cells.
fringe
stairs
stairs
15/31
![Page 58: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/58.jpg)
Tiling Aztec Rectangle with a single defect (cont’d)
Place a fringe where it covers the defect.Place stairs to cover other cells.
fringe
stairs
stairs
15/31
![Page 59: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/59.jpg)
Tiling Aztec Rectangle with a single defect (cont’d)
Place a fringe where it covers the defect.Place stairs to cover other cells.
fringe
stairs
stairs
15/31
![Page 60: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/60.jpg)
Tiling Aztec Rectangle with a single defect (cont’d)
Place a fringe where it covers the defect.Place stairs to cover other cells.
fringe
stairs
stairs
15/31
![Page 61: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/61.jpg)
Tiling Aztec Rectangle with a single defect (cont’d)
Place a fringe where it covers the defect.Place stairs to cover other cells.
fringe
stairs
stairs
15/31
![Page 62: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/62.jpg)
Tiling Aztec Rectangle with a single defect (cont’d)
Place a fringe where it covers the defect.Place stairs to cover other cells.
fringe
stairs
stairs
15/31
![Page 63: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/63.jpg)
Outline
1 IntroductionPolyominoesL-Tromino Tiling Problem
2 Tiling of the Aztec RectanglesAztec RectangleAztec Rectangle with a single defectTiling Aztec Rectangle with unbounded number of defects
3 180-Tromino TilingA rotation constraintForbidden Polyominoes
16/31
![Page 64: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/64.jpg)
Tiling Aztec Rectangle with an unbounded number ofdefects
Given a region R ′, we can embed R ′ inside a sufficiently largeAztec Rectangle ARa,b.
R ′
TheoremThe problem of tiling Aztec Rectangle ARa,b with an unboundednumber of defects is NP-complete.
17/31
![Page 65: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/65.jpg)
Tiling Aztec Rectangle with an unbounded number ofdefects
Given a region R ′, we can embed R ′ inside a sufficiently largeAztec Rectangle ARa,b.
R ′
TheoremThe problem of tiling Aztec Rectangle ARa,b with an unboundednumber of defects is NP-complete.
17/31
![Page 66: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/66.jpg)
Tiling Aztec Rectangle with an unbounded number ofdefects
Given a region R ′, we can embed R ′ inside a sufficiently largeAztec Rectangle ARa,b.
R ′
TheoremThe problem of tiling Aztec Rectangle ARa,b with an unboundednumber of defects is NP-complete.
17/31
![Page 67: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/67.jpg)
Tiling Aztec Rectangle with an unbounded number ofdefects
Given a region R ′, we can embed R ′ inside a sufficiently largeAztec Rectangle ARa,b.
R ′
TheoremThe problem of tiling Aztec Rectangle ARa,b with an unboundednumber of defects is NP-complete.
17/31
![Page 68: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/68.jpg)
Outline
1 IntroductionPolyominoesL-Tromino Tiling Problem
2 Tiling of the Aztec RectanglesAztec RectangleAztec Rectangle with a single defectTiling Aztec Rectangle with unbounded number of defects
3 180-Tromino TilingA rotation constraintForbidden Polyominoes
18/31
![Page 69: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/69.jpg)
180◦L-Tromino Tiling
DefinitionThe 180-tromino tiling problem only allows 180◦ rotations ofL-trominoes, i.e., the tile set can be
Σ = { right-oriented 180-trominoes } = { , }
or
Σ = { left-oriented 180-trominoes } = { , }.
With no loss of generality, we will only consider right-oriented180-trominoes.
19/31
![Page 70: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/70.jpg)
180◦L-Tromino Tiling
DefinitionThe 180-tromino tiling problem only allows 180◦ rotations ofL-trominoes, i.e., the tile set can be
Σ = { right-oriented 180-trominoes } = { , }
or
Σ = { left-oriented 180-trominoes } = { , }.
With no loss of generality, we will only consider right-oriented180-trominoes.
19/31
![Page 71: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/71.jpg)
180◦L-Tromino Tiling
DefinitionThe 180-tromino tiling problem only allows 180◦ rotations ofL-trominoes, i.e., the tile set can be
Σ = { right-oriented 180-trominoes } = { , }
or
Σ = { left-oriented 180-trominoes } = { , }.
With no loss of generality, we will only consider right-oriented180-trominoes.
19/31
![Page 72: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/72.jpg)
180◦L-Tromino Tiling
DefinitionThe 180-tromino tiling problem only allows 180◦ rotations ofL-trominoes, i.e., the tile set can be
Σ = { right-oriented 180-trominoes } = { , }
or
Σ = { left-oriented 180-trominoes } = { , }.
With no loss of generality, we will only consider right-oriented180-trominoes.
19/31
![Page 73: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/73.jpg)
180◦L-Tromino Tiling
DefinitionThe 180-tromino tiling problem only allows 180◦ rotations ofL-trominoes, i.e., the tile set can be
Σ = { right-oriented 180-trominoes } = { , }
or
Σ = { left-oriented 180-trominoes } = { , }.
With no loss of generality, we will only consider right-oriented180-trominoes.
19/31
![Page 74: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/74.jpg)
180◦L-Tromino Tiling
DefinitionThe 180-tromino tiling problem only allows 180◦ rotations ofL-trominoes, i.e., the tile set can be
Σ = { right-oriented 180-trominoes } = { , }
or
Σ = { left-oriented 180-trominoes } = { , }.
With no loss of generality, we will only consider right-oriented180-trominoes.
19/31
![Page 75: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/75.jpg)
180◦L-Tromino Tiling (cont’d)
TheoremThere is a one-one correspondence between 180-tromino tiling andthe triangular trihex tiling [Conway and Lagarias, (1990)].
Two triangular trihex.
Transformation from triangular trihex to 180-tromino
20/31
![Page 76: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/76.jpg)
180◦L-Tromino Tiling (cont’d)
TheoremThere is a one-one correspondence between 180-tromino tiling andthe triangular trihex tiling [Conway and Lagarias, (1990)].
Two triangular trihex.
Transformation from triangular trihex to 180-tromino
20/31
![Page 77: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/77.jpg)
180◦L-Tromino Tiling (cont’d)
TheoremThere is a one-one correspondence between 180-tromino tiling andthe triangular trihex tiling [Conway and Lagarias, (1990)].
Two triangular trihex.
Transformation from triangular trihex to 180-tromino
20/31
![Page 78: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/78.jpg)
180◦L-Tromino Tiling (cont’d)
TheoremThere is a one-one correspondence between 180-tromino tiling andthe triangular trihex tiling [Conway and Lagarias, (1990)].
Two triangular trihex.
Transformation from triangular trihex to 180-tromino20/31
![Page 79: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/79.jpg)
180◦L-Tromino Tiling (cont’d)
DefinitionA cell tetrasection is a division of a cell into 4 equal size cells.
DefinitionA tetrasected polyomino P⊞ is obtained by tetrasecting each cellof a poylomino P.
If there is a I-tromino tiling for some R, then there is also a180-tromino tiling for R⊞.
However, it is not known if the converse statement is true or false.
21/31
![Page 80: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/80.jpg)
180◦L-Tromino Tiling (cont’d)
DefinitionA cell tetrasection is a division of a cell into 4 equal size cells.
DefinitionA tetrasected polyomino P⊞ is obtained by tetrasecting each cellof a poylomino P.
If there is a I-tromino tiling for some R, then there is also a180-tromino tiling for R⊞.
However, it is not known if the converse statement is true or false.
21/31
![Page 81: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/81.jpg)
180◦L-Tromino Tiling (cont’d)
DefinitionA cell tetrasection is a division of a cell into 4 equal size cells.
DefinitionA tetrasected polyomino P⊞ is obtained by tetrasecting each cellof a poylomino P.
If there is a I-tromino tiling for some R, then there is also a180-tromino tiling for R⊞.
However, it is not known if the converse statement is true or false.
21/31
![Page 82: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/82.jpg)
180◦L-Tromino Tiling (cont’d)
DefinitionA cell tetrasection is a division of a cell into 4 equal size cells.
DefinitionA tetrasected polyomino P⊞ is obtained by tetrasecting each cellof a poylomino P.
If there is a I-tromino tiling for some R, then there is also a180-tromino tiling for R⊞.
However, it is not known if the converse statement is true or false.
21/31
![Page 83: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/83.jpg)
180◦L-Tromino Tiling (cont’d)
DefinitionA cell tetrasection is a division of a cell into 4 equal size cells.
DefinitionA tetrasected polyomino P⊞ is obtained by tetrasecting each cellof a poylomino P.
If there is a I-tromino tiling for some R, then there is also a180-tromino tiling for R⊞.
However, it is not known if the converse statement is true or false.
21/31
![Page 84: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/84.jpg)
180◦L-Tromino Tiling (cont’d)
DefinitionA cell tetrasection is a division of a cell into 4 equal size cells.
DefinitionA tetrasected polyomino P⊞ is obtained by tetrasecting each cellof a poylomino P.
If there is a I-tromino tiling for some R, then there is also a180-tromino tiling for R⊞.
However, it is not known if the converse statement is true or false.
21/31
![Page 85: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/85.jpg)
180◦L-Tromino Tiling (cont’d)
DefinitionA cell tetrasection is a division of a cell into 4 equal size cells.
DefinitionA tetrasected polyomino P⊞ is obtained by tetrasecting each cellof a poylomino P.
If there is a I-tromino tiling for some R, then there is also a180-tromino tiling for R⊞.
However, it is not known if the converse statement is true or false.
21/31
![Page 86: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/86.jpg)
180◦L-Tromino Tiling (cont’d)
DefinitionA cell tetrasection is a division of a cell into 4 equal size cells.
DefinitionA tetrasected polyomino P⊞ is obtained by tetrasecting each cellof a poylomino P.
If there is a I-tromino tiling for some R, then there is also a180-tromino tiling for R⊞.
However, it is not known if the converse statement is true or false.21/31
![Page 87: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/87.jpg)
180◦L-Tromino Tiling (cont’d)
Horiyama et al. also proved that the I-tromino tiling problem isNP-Complete.
Theorem [Horiyama, Ito, Nakatsuka, Suzuki and Uehara (2012)]1-in-3 SAT ≤P I-tromino Tiling
22/31
![Page 88: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/88.jpg)
180◦L-Tromino Tiling (cont’d)Horiyama et al. also proved that the I-tromino tiling problem isNP-Complete.
Theorem [Horiyama, Ito, Nakatsuka, Suzuki and Uehara (2012)]1-in-3 SAT ≤P I-tromino Tiling
22/31
![Page 89: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/89.jpg)
180◦L-Tromino Tiling (cont’d)Horiyama et al. also proved that the I-tromino tiling problem isNP-Complete.
Theorem [Horiyama, Ito, Nakatsuka, Suzuki and Uehara (2012)]1-in-3 SAT ≤P I-tromino Tiling
22/31
![Page 90: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/90.jpg)
180◦L-Tromino Tiling (cont’d)Horiyama et al. also proved that the I-tromino tiling problem isNP-Complete.
Theorem [Horiyama, Ito, Nakatsuka, Suzuki and Uehara (2012)]1-in-3 SAT ≤P I-tromino Tiling
22/31
![Page 91: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/91.jpg)
180◦L-Tromino Tiling (cont’d)
In each gadget G , I-tromino tiling for G can be simulated with180-tromino tiling for G⊞.
(a) Original gadget G . (b) Tetrasected gadget G⊞.
Theorem180-tromino tiling is NP-complete.
23/31
![Page 92: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/92.jpg)
180◦L-Tromino Tiling (cont’d)In each gadget G , I-tromino tiling for G can be simulated with180-tromino tiling for G⊞.
(a) Original gadget G . (b) Tetrasected gadget G⊞.
Theorem180-tromino tiling is NP-complete.
23/31
![Page 93: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/93.jpg)
180◦L-Tromino Tiling (cont’d)In each gadget G , I-tromino tiling for G can be simulated with180-tromino tiling for G⊞.
(a) Original gadget G .
(b) Tetrasected gadget G⊞.
Theorem180-tromino tiling is NP-complete.
23/31
![Page 94: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/94.jpg)
180◦L-Tromino Tiling (cont’d)In each gadget G , I-tromino tiling for G can be simulated with180-tromino tiling for G⊞.
(a) Original gadget G . (b) Tetrasected gadget G⊞.
Theorem180-tromino tiling is NP-complete.
23/31
![Page 95: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/95.jpg)
180◦L-Tromino Tiling (cont’d)In each gadget G , I-tromino tiling for G can be simulated with180-tromino tiling for G⊞.
(a) Original gadget G . (b) Tetrasected gadget G⊞.
Theorem180-tromino tiling is NP-complete.
23/31
![Page 96: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/96.jpg)
180◦L-Tromino Tiling (cont’d)In each gadget G , I-tromino tiling for G can be simulated with180-tromino tiling for G⊞.
(a) Original gadget G . (b) Tetrasected gadget G⊞.
Theorem180-tromino tiling is NP-complete.
23/31
![Page 97: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/97.jpg)
180◦L-Tromino Tiling (cont’d)In each gadget G , I-tromino tiling for G can be simulated with180-tromino tiling for G⊞.
(a) Original gadget G . (b) Tetrasected gadget G⊞.
Theorem180-tromino tiling is NP-complete.
23/31
![Page 98: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/98.jpg)
Outline
1 IntroductionPolyominoesL-Tromino Tiling Problem
2 Tiling of the Aztec RectanglesAztec RectangleAztec Rectangle with a single defectTiling Aztec Rectangle with unbounded number of defects
3 180-Tromino TilingA rotation constraintForbidden Polyominoes
24/31
![Page 99: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/99.jpg)
Forbidden Polyominoes
The 180-tromino tiling can also be reduced to the MaximumIndependent Set problem.
Transformation from R to GR :Transform every cell of R to vertices of GR .Add horizontal, vertical and northeast-diagonal edges.
Transformation from GR to IR :Transform every 3-cycle of GR to vertices of IR .Add an edge where 3-cycles intersects.
25/31
![Page 100: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/100.jpg)
Forbidden Polyominoes
The 180-tromino tiling can also be reduced to the MaximumIndependent Set problem.
Transformation from R to GR :Transform every cell of R to vertices of GR .Add horizontal, vertical and northeast-diagonal edges.
Transformation from GR to IR :Transform every 3-cycle of GR to vertices of IR .Add an edge where 3-cycles intersects.
25/31
![Page 101: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/101.jpg)
Forbidden Polyominoes
The 180-tromino tiling can also be reduced to the MaximumIndependent Set problem.
R
Transformation from R to GR :Transform every cell of R to vertices of GR .Add horizontal, vertical and northeast-diagonal edges.
Transformation from GR to IR :Transform every 3-cycle of GR to vertices of IR .Add an edge where 3-cycles intersects.
25/31
![Page 102: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/102.jpg)
Forbidden Polyominoes
The 180-tromino tiling can also be reduced to the MaximumIndependent Set problem.
R
Transformation from R to GR :Transform every cell of R to vertices of GR .Add horizontal, vertical and northeast-diagonal edges.
Transformation from GR to IR :Transform every 3-cycle of GR to vertices of IR .Add an edge where 3-cycles intersects.
25/31
![Page 103: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/103.jpg)
Forbidden Polyominoes
The 180-tromino tiling can also be reduced to the MaximumIndependent Set problem.
R GR
Transformation from R to GR :Transform every cell of R to vertices of GR .Add horizontal, vertical and northeast-diagonal edges.
Transformation from GR to IR :Transform every 3-cycle of GR to vertices of IR .Add an edge where 3-cycles intersects.
25/31
![Page 104: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/104.jpg)
Forbidden Polyominoes
The 180-tromino tiling can also be reduced to the MaximumIndependent Set problem.
R GR
Transformation from R to GR :Transform every cell of R to vertices of GR .Add horizontal, vertical and northeast-diagonal edges.
Transformation from GR to IR :Transform every 3-cycle of GR to vertices of IR .Add an edge where 3-cycles intersects.
25/31
![Page 105: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/105.jpg)
Forbidden Polyominoes
The 180-tromino tiling can also be reduced to the MaximumIndependent Set problem.
R GR
Transformation from R to GR :Transform every cell of R to vertices of GR .Add horizontal, vertical and northeast-diagonal edges.
Transformation from GR to IR :Transform every 3-cycle of GR to vertices of IR .Add an edge where 3-cycles intersects.
25/31
![Page 106: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/106.jpg)
Forbidden Polyominoes
The 180-tromino tiling can also be reduced to the MaximumIndependent Set problem.
R GR
Transformation from R to GR :Transform every cell of R to vertices of GR .Add horizontal, vertical and northeast-diagonal edges.
Transformation from GR to IR :Transform every 3-cycle of GR to vertices of IR .Add an edge where 3-cycles intersects.
25/31
![Page 107: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/107.jpg)
Forbidden Polyominoes
The 180-tromino tiling can also be reduced to the MaximumIndependent Set problem.
R GR
Transformation from R to GR :Transform every cell of R to vertices of GR .Add horizontal, vertical and northeast-diagonal edges.
Transformation from GR to IR :Transform every 3-cycle of GR to vertices of IR .Add an edge where 3-cycles intersects.
25/31
![Page 108: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/108.jpg)
Forbidden Polyominoes
The 180-tromino tiling can also be reduced to the MaximumIndependent Set problem.
R GR IR
Transformation from R to GR :Transform every cell of R to vertices of GR .Add horizontal, vertical and northeast-diagonal edges.
Transformation from GR to IR :Transform every 3-cycle of GR to vertices of IR .Add an edge where 3-cycles intersects.
25/31
![Page 109: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/109.jpg)
Forbidden Polyominoes
The 180-tromino tiling can also be reduced to the MaximumIndependent Set problem.
R GR IR
Transformation from R to GR :Transform every cell of R to vertices of GR .Add horizontal, vertical and northeast-diagonal edges.
Transformation from GR to IR :Transform every 3-cycle of GR to vertices of IR .Add an edge where 3-cycles intersects.
25/31
![Page 110: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/110.jpg)
Forbidden Polyominoes
The 180-tromino tiling can also be reduced to the MaximumIndependent Set problem.
R GR IR
Transformation from R to GR :Transform every cell of R to vertices of GR .Add horizontal, vertical and northeast-diagonal edges.
Transformation from GR to IR :Transform every 3-cycle of GR to vertices of IR .Add an edge where 3-cycles intersects.
25/31
![Page 111: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/111.jpg)
Forbidden Polyominoes
The 180-tromino tiling can also be reduced to the MaximumIndependent Set problem.
R GR IR
Transformation from R to GR :Transform every cell of R to vertices of GR .Add horizontal, vertical and northeast-diagonal edges.
Transformation from GR to IR :Transform every 3-cycle of GR to vertices of IR .Add an edge where 3-cycles intersects.
25/31
![Page 112: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/112.jpg)
Forbidden Polyominoes
The 180-tromino tiling can also be reduced to the MaximumIndependent Set problem.
R GR IR
Transformation from R to GR :Transform every cell of R to vertices of GR .Add horizontal, vertical and northeast-diagonal edges.
Transformation from GR to IR :Transform every 3-cycle of GR to vertices of IR .Add an edge where 3-cycles intersects.
25/31
![Page 113: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/113.jpg)
Forbidden Polyominoes
The 180-tromino tiling can also be reduced to the MaximumIndependent Set problem.
R GR IR
Transformation from R to GR :Transform every cell of R to vertices of GR .Add horizontal, vertical and northeast-diagonal edges.
Transformation from GR to IR :Transform every 3-cycle of GR to vertices of IR .Add an edge where 3-cycles intersects.
25/31
![Page 114: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/114.jpg)
Forbidden Polyominoes
The 180-tromino tiling can also be reduced to the MaximumIndependent Set problem.
R GR IR
Transformation from R to GR :Transform every cell of R to vertices of GR .Add horizontal, vertical and northeast-diagonal edges.
Transformation from GR to IR :Transform every 3-cycle of GR to vertices of IR .Add an edge where 3-cycles intersects.
25/31
![Page 115: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/115.jpg)
Forbidden Polyominoes
The 180-tromino tiling can also be reduced to the MaximumIndependent Set problem.
R GR IR
Transformation from R to GR :Transform every cell of R to vertices of GR .Add horizontal, vertical and northeast-diagonal edges.
Transformation from GR to IR :Transform every 3-cycle of GR to vertices of IR .Add an edge where 3-cycles intersects.
25/31
![Page 116: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/116.jpg)
Forbidden Polyominoes (cont’d)
Theorem
Maximum Independent Set of IR is equal to |R|3
⇐⇒ R has a 180-tromino tiling .
where |R| the number of cells in a region R.
26/31
![Page 117: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/117.jpg)
Forbidden Polyominoes (cont’d)
R GR IR
Theorem
Maximum Independent Set of IR is equal to |R|3
⇐⇒ R has a 180-tromino tiling .
where |R| the number of cells in a region R.
26/31
![Page 118: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/118.jpg)
Forbidden Polyominoes (cont’d)
R GR IR
Theorem
Maximum Independent Set of IR is equal to |R|3
⇐⇒ R has a 180-tromino tiling .
where |R| the number of cells in a region R.
26/31
![Page 119: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/119.jpg)
Forbidden Polyominoes (cont’d)
R GR IR
Theorem
Maximum Independent Set of IR is equal to |R|3
⇐⇒ R has a 180-tromino tiling .
where |R| the number of cells in a region R.
26/31
![Page 120: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/120.jpg)
Forbidden Polyominoes (cont’d)
R GR IR
Theorem
Maximum Independent Set of IR is equal to |R|3
⇐⇒ R has a 180-tromino tiling .
where |R| the number of cells in a region R.
26/31
![Page 121: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/121.jpg)
Forbidden Polyominoes (cont’d)
R GR IR
Theorem
Maximum Independent Set of IR is equal to |R|3
⇐⇒ R has a 180-tromino tiling .
where |R| the number of cells in a region R.
26/31
![Page 122: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/122.jpg)
Forbidden Polyominoes (cont’d)
If IG is claw-free, i.e., does not contain a claw as induced graph,then computing Maximum Independent Set can be computed inpolynomial time.
The following five polyominoes generates a distinct IG with a clawin it.
27/31
![Page 123: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/123.jpg)
Forbidden Polyominoes (cont’d)If IG is claw-free, i.e., does not contain a claw as induced graph,then computing Maximum Independent Set can be computed inpolynomial time.
The following five polyominoes generates a distinct IG with a clawin it.
27/31
![Page 124: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/124.jpg)
Forbidden Polyominoes (cont’d)If IG is claw-free, i.e., does not contain a claw as induced graph,then computing Maximum Independent Set can be computed inpolynomial time.
The following five polyominoes generates a distinct IG with a clawin it.
27/31
![Page 125: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/125.jpg)
Forbidden Polyominoes (cont’d)If IG is claw-free, i.e., does not contain a claw as induced graph,then computing Maximum Independent Set can be computed inpolynomial time.
The following five polyominoes generates a distinct IG with a clawin it.
27/31
![Page 126: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/126.jpg)
Forbidden Polyominoes (cont’d)If IG is claw-free, i.e., does not contain a claw as induced graph,then computing Maximum Independent Set can be computed inpolynomial time.
The following five polyominoes generates a distinct IG with a clawin it.
27/31
![Page 127: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/127.jpg)
Forbidden Polyominoes (cont’d)
TheoremIf a region R doesn’t contains a rotated, reflected or shearedforbidden polyomino, then 180-tromino tiling can be computed ina polynomial time.
28/31
![Page 128: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/128.jpg)
Forbidden Polyominoes (cont’d)
TheoremIf a region R doesn’t contains a rotated, reflected or shearedforbidden polyomino, then 180-tromino tiling can be computed ina polynomial time.
28/31
![Page 129: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/129.jpg)
Thank you!
29/31
![Page 130: Hard and Easy Instances of L-Tromino Tilings 1](https://reader033.fdocuments.in/reader033/viewer/2022041507/62525d9012f1c109126140ce/html5/thumbnails/130.jpg)
Thank you!
You can try the tetrasected cell tiling program in your phonebrowser: http://bit.ly/TetrasectedTiling
30/31