P76 · Extremal configurations · Classic

Covering a square with n equilateral triangles

VERIFIED CONSTRUCTIONcommon side 0.707811412
n = 6Current record · open

Cover the unit square with n congruent equilateral triangles. Every piece may be translated, rotated and flipped independently; arbitrary overlap and protrusion are allowed. Minimise the common side.

Formal definition

  • ContainerThe closed unit square K = [0,1] × [0,1]
  • Piecesn equilateral triangles of common side s; every piece may be translated and rotated independently, with the third vertex on either side of its reference edge
  • SubmissionGive the common side s plus one reference-edge midpoint, rotation and orientation for each triangle; submit exactly n pieces
  • CoverEvery point of the square lies in at least one closed triangle; triangles may overlap and protrudeKT1Tn
  • Exact rotationThe certificate writes rotations as turn = tan(θ/2). Half-angle identities make cos θ and sin θ rational, so every vertex and intersection is computed exactly in Q(√3)
  • Continuous verificationThe verifier builds the planar arrangement of triangle and square edges, then performs an exact algebraic vertical sweep for uncovered faces; it uses neither pixels nor random sampling
  • ScoreThe side s shared by every submitted triangle; smaller is betters(T)=s
  • ObjectiveMinimise s over all legal coversminTs(T)

Getting a feel for it

Why this is not tiling

A square has 90° corners and an equilateral triangle has 60° corners. The boundary angles do not match, so good covers must overlap and protrude. Adding one piece can reorganise the whole contact pattern rather than append one more tile.

The published frontier

Friedman's public table gives the best known constructions for n=1–12, with nontrivial layouts already at n=2 and independent rotations from n ≥ 4. This site reconstructs the pictured arrangements and rechecks continuous coverage instead of copying numbers alone.

Source
ONE LEADERBOARD PER n

Current best solutions by n

Each n is an independent record with a page of its own. Open any of them to inspect the current construction, then challenge it.

Discussion (0) ↓
n2
CURRENT RECORD1.366025405best known 1.366025403784439
Hard
Answer sourceDavid Cantrell
Solution methodPublished reference construction
View problem
n3
CURRENT RECORD1.07735027best known 1.077350269189626
Hard
Answer sourceDavid Cantrell
Solution methodPublished reference construction
View problem
n4
CURRENT RECORD0.910688928best known 0.910683602522959
Hard
Answer sourceErich Friedman
Solution methodPublished reference construction
View problem
n5
CURRENT RECORD0.804133275best known 0.803089950658687
Hard
Answer sourceDavid Cantrell
Solution methodPublished reference construction
View problem
n6
CURRENT RECORD0.707811412best known 0.707668681701230
Hard
Answer sourceMaurizio Morandi
Solution methodPublished reference construction
View problem
n7
CURRENT RECORD0.653229052best known 0.653129933440798
Hard
Answer sourceMaurizio Morandi
Solution methodPublished reference construction
View problem
n8
CURRENT RECORD0.599559417best known 0.598847943125924
Hard
Answer sourceMaurizio Morandi
Solution methodPublished reference construction
View problem
n9
CURRENT RECORD0.564748618best known 0.564435602013652
Hard
Answer sourceMaurizio Morandi
Solution methodPublished reference construction
View problem
n10
CURRENT RECORD0.530227833best known 0.530011547174745
Hard
Answer sourceMaurizio Morandi
Solution methodPublished reference construction
View problem
n11
CURRENT RECORD0.504894626best known 0.504527934491533
Hard
Answer sourceMaurizio Morandi
Solution methodPublished reference construction
View problem
n12
CURRENT RECORD0.479941887best known 0.479274057836310
Hard
Answer sourceMaurizio Morandi
Solution methodPublished reference construction
View problem

Data and citation

Every sub-problem in this family — authoritative scores, proof status, coordinates and sources — lives at the stable address below, published under CC BY 4.0. Scores move as records fall, so cite the generatedAt timestamp the file carries.

GET https://minmaxarena.com/data/equilateral-triangles-covering-a-square.json

Cite the frozen 2026-08 edition: records move, a frozen edition never does, so the citation is still checkable years later.

GET https://minmaxarena.com/data/editions/2026-08/equilateral-triangles-covering-a-square.json
BibTeX (click to copy)
@misc{minmaxarena-equilateral-triangles-covering-a-square-2026-08,
  title  = {{Covering a square with n equilateral triangles} (P76)},
  author = {{MinMax Arena}},
  year   = {2026},
  note   = {Machine-verified records, 2026-08 edition},
  url    = {https://minmaxarena.com/data/editions/2026-08/equilateral-triangles-covering-a-square.json},
  license = {CC BY 4.0}
}
DISCUSSION

Discussion

Talk strategy, share methods, ask why you are stuck. Posts carry your public byline, the same name your records use; the #number after it is the account's signup ordinal, so a name cannot be worn by someone else. The floor is earned: break a record once, anywhere, and it is yours for good. New posts appear after an automated review.

No threads yet. Be the first to talk about this problem?