Periodic and aperiodic tilings Covering a flat surface ("the plane") with some pattern of geometric shapes ("tiles"), with no overlaps or gaps, is called a
tiling. The most familiar tilings, such as covering a floor with squares meeting edge-to-edge, are examples of
periodic tilings. If a square tiling is shifted by the width of a tile, parallel to the sides of the tile, the result is the same pattern of tiles as before the shift. A shift (formally, a
translation) that preserves the tiling in this way is called a
period of the tiling. A tiling is called periodic when it has periods that shift the tiling in two different directions. The tiles in the square tiling have only one shape, and it is common for other tilings to have only a
finite number of shapes. These shapes are called
prototiles, and
a set of prototiles is said to
admit a tiling or
tile the plane if there is a tiling of the plane using only these shapes. That is, each tile in the tiling must be
congruent to one of these prototiles. A tiling that has no periods is
non-periodic. A set of prototiles is said to be
aperiodic if all of its tilings are non-periodic, and in this case its tilings are also called
aperiodic tilings. Penrose tilings are among the simplest known examples of aperiodic tilings of the plane by finite sets of prototiles.|alt= The subject of aperiodic tilings received new interest in the 1960s when logician
Hao Wang noted connections between
decision problems and tilings. In particular, he introduced tilings by square plates with colored edges, now known as
Wang dominoes or
tiles, and posed the "
Domino Problem": to determine whether a given set of Wang dominoes could tile the plane with matching colors on adjacent domino edges. He observed that if this problem were
undecidable, then there would have to exist an aperiodic set of Wang dominoes. At the time, this seemed implausible, so Wang conjectured no such set could exist. Wang's student
Robert Berger proved that the Domino Problem was undecidable (so Wang's conjecture was incorrect) in his 1964 thesis, and obtained an aperiodic set of 20,426 Wang dominoes. He also described a reduction to 104 such prototiles; the latter did not appear in his published monograph, but in 1968,
Donald Knuth detailed a modification of Berger's set requiring only 92 dominoes. The color matching required in a tiling by Wang dominoes can easily be achieved by modifying the edges of the tiles like
jigsaw puzzle pieces so that they can fit together only as prescribed by the edge colorings.
Raphael Robinson, in a 1971 paper which simplified Berger's techniques and undecidability proof, used this technique to obtain an aperiodic set of just six prototiles.
Development of the Penrose tilings The first Penrose tiling (tiling P1 below) is an aperiodic set of six prototiles, introduced by
Roger Penrose in a 1974 paper, based on pentagons rather than squares. Any attempt to tile the plane with regular pentagons necessarily leaves gaps, but
Johannes Kepler showed, in his 1619 work
Harmonices Mundi, that these gaps can be filled using
pentagrams (
star polygons),
decagons and related shapes. Kepler extended this tiling by five polygons and found no periodic patterns, and already conjectured that every extension would introduce a new feature hence creating an aperiodic tiling. Traces of these ideas can also be found in the work of
Albrecht Dürer. Acknowledging inspiration from Kepler, Penrose found matching rules for these shapes, obtaining an aperiodic set. These matching rules can be imposed by decorations of the edges, as with the Wang tiles. Penrose's tiling can be viewed as a completion of Kepler's finite
Aa pattern. at Zelená hora, Czech Republic Penrose subsequently reduced the number of prototiles to two, discovering the kite and dart tiling (tiling P2 below) and the rhombus tiling (tiling P3 below). The rhombus tiling was independently discovered by
Robert Ammann in 1976. Penrose and
John H. Conway investigated the properties of Penrose tilings, and discovered that a substitution property explained their hierarchical nature; their findings were publicized by
Martin Gardner in his January 1977 "
Mathematical Games" column in
Scientific American. In 1981,
N. G. de Bruijn provided two different methods to construct Penrose tilings. De Bruijn's "multigrid method" obtains the Penrose tilings as the
dual graphs of
arrangements of five families of parallel lines. In his "cut and project method", Penrose tilings are obtained as two-dimensional projections from a
five-dimensional cubic structure. In these approaches, the Penrose tiling is viewed as a set of points, its vertices, while the tiles are geometrical shapes obtained by connecting vertices with edges. A 1990 construction by Baake, Kramer, Schlottmann, and Zeidler derived the Penrose tiling and the related
Tübingen triangle tiling in a similar manner from the four-dimensional
5-cell honeycomb. ==Penrose tilings==