Why some shapes can tile a floor and others cannot

Introduction

Tiling — covering a flat surface with repeated shapes without gaps or overlaps — looks simple but touches deep ideas in geometry, symmetry and arithmetic. Some shapes fit together perfectly to tile a floor, while others never will. This article explains why, using clear geometry, examples, and simple tests anyone can try.

What does “tile” mean in geometry?

In everyday language, to tile a floor means to cover it with tiles so there are no gaps or overlaps. In geometry, the same idea is called a tessellation: an arrangement of copies of one or more shapes (called tiles) that fills the plane without gaps or overlaps.

Key points:

Every copy of the tile is congruent (the same size and shape), unless we allow different sizes or reflections specifically.

Tessellations can be periodic (a repeating pattern) or nonperiodic (no repeating translational pattern), but for a single tile shape the basic question is whether some arrangement can fill the plane at all.

Early intuition: angles and edges

The most immediate reason some shapes tile while others don’t comes from how their edges and angles fit around a point.

For a shape to tile the plane, angles at a vertex where several tiles meet must add up to exactly 360 degrees. If the angles around a corner of the shape are too large or too small to sum to 360 in some combination of whole copies, that shape cannot form a gapless meeting around a point.

Example: triangles and quadrilaterals always tile. Why? Any triangle’s three angles add to 180 degrees, so two copies of the same triangle placed at a side create a 360-degree meeting around a point (180+180). Any quadrilateral’s angles sum to 360, so four copies can be arranged around a point to sum to 360. That simple angle arithmetic explains why every triangle and every quadrilateral can tessellate the plane.

Regular polygons: a clear classification

Regular polygons have equal sides and equal angles, which makes it easy to test whether they tile.

If a regular polygon has interior angle A degrees, then k copies meet at a point if k*A = 360. Since A = 180*(n-2)/n for an n-sided regular polygon, that gives a simple condition: 360/A must be an integer.

Applying this rule shows only equilateral triangles (n=3), squares (n=4), and regular hexagons (n=6) tile by themselves in a periodic way. Regular pentagons, heptagons and others cannot because their interior angle does not divide 360 evenly. That’s why bathroom tiles are often squares or hexagons, not regular pentagons.

Beyond angles: edge matching and shape features

Angles are necessary to check but not always sufficient. How edges and other features match matters too.

Concave shapes (those with indentations) can sometimes tile and sometimes not. A concave shape might interlock with copies of itself, filling gaps the angle test alone wouldn’t predict. Conversely, a convex shape (no indentations) with angle measures that could sum correctly might still fail if edges and lengths don’t align properly.

Edge length and orientation: for a tiling to work, matching edges must be compatible. If a tile has sides of different lengths, the arrangement must pair edges of the same length and align orientations so copies meet without overlap. In practice, that often restricts how tiles can be placed and may prevent a tessellation.

Symmetry and periodic patterns

Symmetry often helps produce tilings. A shape with reflective symmetry or rotational symmetry offers natural ways for copies to fit together. Periodic tilings (those with a repeating pattern) correspond to arranging tiles in a lattice pattern using translations, rotations, and sometimes reflections.

A tile that allows a translation symmetry in two independent directions is easy to use in a periodic tiling. Squares and hexagons have symmetries that let you lay them in a repeating grid. Some shapes only tile in nonperiodic ways (no repeating translation pattern) and those are more complex to discover.

Special cases: pentagons and the search for tilers

Pentagons (five-sided polygons) demonstrate that vertex-angle divisibility is not the whole story. Regular pentagons cannot tile, but many irregular pentagons can. Mathematicians studied which convex pentagons tile the plane for over a century.

The classification progressed by finding families of pentagons with certain combinations of equal edges or angles that force a workable arrangement. In 2015 a group of researchers completed the classification of convex pentagons that tile the plane, showing there are 15 types (families) defined by algebraic relations between side lengths and angles. That result illustrates that a shape’s ability to tile can be subtle and depend on precise relations between its sides and angles.

Nonperiodic tilings and aperiodic tiles

Not all tilings repeat. Nonperiodic tilings cover the plane without a repeating translational pattern. The most famous example uses two shapes called Penrose tiles. A single tile shape (an “einstein” in one sense) that forces nonperiodic tiling was a long-standing question; recently researchers found a single aperiodic monotile under certain rules, showing that the landscape of tiling possibilities is still evolving.

Aperiodic tilings show that lack of periodic symmetry does not prevent tiling. The constraints that force nonperiodicity are built into the tile shapes or matching rules (rules that restrict how edges fit together). This is why some complex-looking shapes tile only in elaborate, nonrepeating ways rather than simple grid patterns.

Mathematical tools for deciding tilability

Several mathematical ideas help decide whether a shape can tile:

Angle sums at vertices: as explained, angle arithmetic provides quick necessary conditions.

Edge-coloring and matching rules: assigning labels or colors to edges and requiring labels to match when tiles meet can formalize compatibility conditions.

Group theory and symmetry: studying the symmetry group of a tiling or of the tile shape helps classify the patterns that are possible.

Combinatorial and geometric tiling theory: mathematicians use case analysis, inequalities between side lengths, and construction methods to prove a shape can tile, and impossibility proofs to show a shape cannot.

Computer search: for many practical tiling questions, exhaustive or guided computer searches help find tilings or prove none exist up to a search limit. But infinite-plane tilability remains a theoretical question that sometimes needs mathematical proof rather than computation alone.

Simple practical tests you can try

Here are hands-on ways to explore whether a shape can tile:

Angle test: measure the interior angles of the shape. Try to find small integer combinations that add up to 360. If no combination of whole copies can reach 360 at a vertex, the shape cannot tile with that vertex meeting pattern.

Edge pairing: check if the sides come in equal lengths that could pair neatly when tiles meet. Try cutting paper copies and experiment putting edges together.

Build clusters: paste several copies together around different vertices and see whether you can extend the cluster indefinitely without leaving forced gaps or overlaps.

Try reflections and rotations: sometimes reflecting a tile or rotating by 180 degrees reveals a matching that is not obvious with translations only.

Applications and why this matters

Tiling theory is practical as well as theoretical. Applications include flooring and wall designs, computer graphics (texture mapping), materials science (studying crystal structures and quasicrystals), architecture, and art.

Understanding which shapes tile helps designers choose efficient, attractive patterns and helps scientists model structures where local rules determine global patterns, such as in certain alloys or biological tissues.

Common misconceptions

Misconception: “If a shape looks irregular it won’t tile.” False — many irregular shapes tile, sometimes in surprising ways.

Misconception: “If a shape tiles a small region, it must tile the whole plane.” Not necessarily. A shape may form a finite cluster without a way to continue the pattern indefinitely without creating a gap or overlap.

Misconception: “Only polygons matter.” Tiles can be curved shapes too. The same principles — angle-like measures, curvature, and edge matching — extend to more general shapes, but the tests become more geometric than arithmetic.

When a shape definitely cannot tile

There are clear impossibility reasons:

Vertex angle obstruction: if no integer combination of the tile’s corner angles adds to 360, then copies cannot meet to fill around a point.

Edge-length incommensurability: if the tile’s side lengths are incommensurate (no rational ratios) in ways that prevent matching after translations, it may be impossible to arrange edges to meet everywhere.

Topological obstructions: for shapes with holes or disconnected parts, filling the plane without overlaps or gaps may be impossible because copies cannot group to produce the necessary local configurations.

Where current research still explores

Mathematicians continue to ask deep questions about tilings: which tile shapes force nonperiodic tilings, classification of tiles in specific families (like convex pentagons), and how local matching rules govern global order. New constructions and proofs appear occasionally, showing the subject is active and sometimes surprising.

Conclusion

Whether a shape can tile a floor depends on how its angles, edges and symmetries allow copies to meet without gaps or overlaps. Simple angle arithmetic explains why all triangles and quadrilaterals tile and why only equilateral triangles, squares and hexagons tile among regular polygons. Beyond that, edge matching, concavity, and symmetry determine more subtle possibilities. Hands-on experiments, angle checks, and mathematical tools reveal when a shape will fill the plane and when it cannot.