Wang Tiles: Connectivity when Tiling a Plane
Discrete and Computational Geometry, Graphs, and Games
Keywords:Wang tiles, tiling, complexity
Inspired by the Nintendo game Zelda, the problem of tessellating the plane by translated copies from a set of Wang tiles is generalized to the connected tiling problem. We solve the connected tiling problem for the case that there is only one door color and one wall color in this paper.