NP-completeness of Tiling Finite Simply Connected Regions with a Fixed
Set of Wang Tiles
NP-completeness of Tiling Finite Simply Connected Regions with a Fixed
Set of Wang Tiles
The computational complexity of tiling finite simply connected regions with a fixed set of tiles is studied in this paper. We show that the problem of tiling simply connected regions with a fixed set of $23$ Wang tiles is NP-complete. As a consequence, the problem of tiling simply connected regions …