A Wang tile is a unit square with a color assigned to each of its four sides. Copies of the tiles are placed by translations, without rotations or reflections, and the colors on the touching sides of adjacent tiles must agree. A finite set of tile types can admit no tiling of the plane, a periodic tiling of the plane, or only aperiodic tilings of the plane.
The figure shows a single Wang tile at left and a patch of four tiles with matching colors along shared sides at right.
An aperiodic set of Wang tiles admits a tiling of the plane but no periodic tiling. Wang's conjecture asserted that such a set could not exist. Jeandel and Rao (2021) constructed an aperiodic set of 11 Wang tiles using four colors and proved that neither fewer tiles nor fewer colors suffice.
Wang tiles also encode computation. The problem of deciding whether a finite set of Wang tiles can tile the plane is recursively undecidable. Almeida and Knudstorp (2026) use this problem and its periodic variant to obtain reported undecidability results for Skvortsov logic and Medvedev logic, respectively.
For a finite region of the square grid with prescribed boundary colors, put a four-index tensor at each square, with one index for the color on each side. The entry is 1 if a tile with those ordered colors is allowed and 0 otherwise. A tensor network identifies the two indices on every shared side and sums over their common color. The product of the entries for an assignment of colors is 1 exactly when the assignment gives a valid tiling, so the tensor contraction counts the tilings. For weighted tile types, using the total weight of the types with each color tuple gives the sum of the products of tile weights over all tilings (Liang 2026).