Wang Tiles: Connectivity when Tiling a Plane: Discrete and Computational Geometry, Graphs, and Games

Chao Yang

Wang Tiles: Connectivity when Tiling a Plane

Discrete and Computational Geometry, Graphs, and Games

Authors

Chao Yang Guangdong University of Foreign Studies

Keywords:

Wang tiles, tiling, complexity

Abstract

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.

Downloads

Published

2023-12-31

How to Cite

Yang, C. (2023). Wang Tiles: Connectivity when Tiling a Plane: Discrete and Computational Geometry, Graphs, and Games. Thai Journal of Mathematics, 21(4), 991–1009. Retrieved from https://thaijmath2.in.cmu.ac.th/index.php/thaijmath/article/view/1561