Aperiodic set of prototiles seen on the list of aperiodic sets of tiles. The underlying undecidability of the domino problem implies that there exists no systematic procedure for deciding whether a given set of tiles can tile the plane. Polygons are plane figures which are bounded by straight line segments. Regular polygons have all sides of equal length as well as all angles of equal measure. As early as AD 325, Pappus of Alexandria knew that only 3 types of regular polygons (the square, equilateral triangle, and hexagon) can fit perfectly together in repeating tessellations on a Euclidean plane. Within that plane, every triangle,
Euclidean tilings by convex regular polygons figures, which are also called "m"-Archimedean tilings. For edge-to-edge Euclidean tilings, the internal angles of the polygons meeting at a vertex must add to 360 degrees. A regular -gon has internal angle formula_1 degrees. There are seventeen combinations of regular polygons whose internal angles add up to 360 degrees, each being referred to as a "species" of vertex; in four cases there are two distinct cyclic orders of the polygons, yielding twenty-one "types" of vertex. Only eleven of these can occur in a uniform tiling of regular polygons, given in previous sections. In particular, if three polygons meet at a