Wang tiles (or Wang dominoes), first proposed by mathematician, logician, and philosopher Hao Wang in 1961, are a class of formal systems. They are modelled visually by equalsized squares with a color on each edge which can be arranged side by side (on a regular square grid) so that abutting edges of adjacent tiles have the same color; the tiles cannot be rotated or reflected.
The basic question about sets of Wang tiles is proving whether they can tile the plane or not. This means that copies of the tiles can be arranged one by one to fill an infinite plane, without any grid position where no tile in the set can match the side colors of already laid out adjacent tiles.
In 1961, Wang presented an algorithm to take any finite set of tiles and decide whether they tiled the plane. In his purported proof of the correctness of the algorithm, he assumed that any set that could tile the plane would be able to tile the plane periodically (with a pattern that repeats, like standard wallpaper).
However, in 1966 Robert Berger proved Wang's conjecture was wrong. He presented a set of Wang tiles that could only tile the plane aperiodically. This meant it could fill the plane without holes, but the tiling couldn't be a simple repetition of a finite pattern. This is similar to a Penrose tiling, or the arrangement of atoms in a quasicrystal. Although Berger's original set contained 20,426 tiles, he hypothesized that smaller sets would work, including subsets of his set. In later years, increasingly smaller sets were found. For example, the set of 13 tiles given above is an aperiodic set published by Karel Culik, II, in 1996. It can tile the plane, but not periodically.
Wang's algorithm for determining whether a given set of tiles can tile the plane was not correct. In fact, no such algorithm can exist. It is possible to translate any Turing machine into a set of Wang tiles, such that the Wang tiles can tile the plane if and only if the Turing machine will never halt. The halting problem is undecidable, therefore the Wang tiling problem is also uncomputable. In a sense, Wang tiles have computational power equivalent to that of a Turing machine.
The fact that Wang's procedure cannot theoretically work for arbitrary large tile sets does not render it useless for practical purposes.
Wang tiles can be generalized in various ways, all of which are also undecidable in the above sense. For example, Wang cubes are equalsized cubes with colored faces and side colors can be matched on any polygonal tessellation. Culik and Kari have demonstrated aperiodic sets of Wang cubes. Winfree et al. have demonstrated the feasibility of creating molecular "tiles" made from DNA (deoxyribonucleic acid) that can act as Wang tiles. Mittal et al. have shown that these tiles can also be composed of peptide nucleic acid (PNA), a stable artificial mimic of DNA.
Wang tiles have recently become a popular tool for procedural synthesis of textures, heightfields, and other large and nonrepeating bidimensional data sets; a small set of precomputed or handmade source tiles can be assembled very cheaply without too obvious repetitions and without periodicity. In this case, traditional aperiodic tilings would show their very regular structure; much less constrained sets that guarantee at least two tile choices for any two given side colors are common because tileability is easily ensured and each tile can be selected pseudorandomly. Important papers about this new application include:
 Jos Stam (1997), Aperiodic Texture Mapping introduces the idea of using Wang tiles for texture variation, with a deterministic substitution system.
 Michael F. Cohen, Jonathan Shade, Stefan Hiller, Oliver Deussen (2003), Wang Tiles for Image and Texture Generation introduces stochastic tiling and is very popular.
 LiYi Wei (2004), "TileBased Texture Mapping on Graphics Hardware" applies Wang Tiles for realtime texturing on a GPU
 Johannes Kopf, Daniel CohenOr, Oliver Deussen, Dani Lischinski (2006), Recursive Wang Tiles for RealTime Blue Noise shows advanced applications.
Full article ▸
