Wang Tiles: Connectivity when Tiling a Plane

被引：0

作者：

Yang, Chao ^{[1
]}

机构：

[1] Guangdong Univ Foreign Studies, Sch Math & Stat, Guangzhou 510006, Peoples R China

来源：

THAI JOURNAL OF MATHEMATICS | 2023年 / 21卷 / 04期

基金：

中国国家自然科学基金;

关键词：

Wang tiles; tiling; complexity; NONEMPTINESS PROBLEMS; UNDECIDABILITY;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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.

引用

页码：991 / 1009

页数：19

共 7 条

[1]

BERGER R, 1966, MEM AM MATH SOC, P1

[2] Nonemptiness problems of Wang tiles with three colors [J].

Chen, Hung-Hsun ;

Hu, Wen-Guei ;

Lai, De-Jan ;

Lin, Song-Sun .

THEORETICAL COMPUTER SCIENCE, 2014, 547 :34-45

[3] NONEMPTINESS PROBLEMS OF PLANE SQUARE TILING WITH TWO COLORS [J].

Hu, Wen-Guei ;

Lin, Song-Sun .

PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 2011, 139 (03) :1045-1059

[4]

Jeandel R., 2021, Paper No. 1, V#1, P1, DOI DOI 10.19086/AIC.18614

[5] UNDECIDABILITY AND NONPERIODICITY FOR TILINGS OF PLANE [J].

ROBINSON, RM .

INVENTIONES MATHEMATICAE, 1971, 12 (03) :177-&

[6] GAMES LOGIC AND COMPUTERS [J].

WANG, H .

SCIENTIFIC AMERICAN, 1965, 213 (05) :98-&

[7]

WANG H, 1961, AT&T TECH J, V40, P1

← 1 →