Covering an equilateral triangle with n equilateral triangles
Continuously cover the unit equilateral triangle with n congruent equilateral triangles. Overlap and protrusion are allowed; minimise the common side.
Formal definition
- ContainerThe closed equilateral triangle K = conv{(0,0),(1,0),(0.5,√3/2)}
- SubmissionA common side s and exactly n {x,y,turn,down} placements, each independently rotatable and flippable
- CoverEvery point of K belongs to at least one closed covering triangle
- Exact continuous verificationThe verifier computes all container edges, piece edges, and intersections exactly in Q(√3), then performs a vertical sweep to verify full coverage
- ScoreThe common side s shared by all covering triangles; smaller is better
- ObjectiveMinimise s over all valid covers
Getting a feel for it
Non-square piece counts
Only when n is a perfect square can a regular triangular grid tile the container without overlap or protrusion. Other values of n require overlapping, rotated, or protruding pieces, and adding one piece often alters the layered structure.
Known constructions and literature data
Friedman's table lists constructions for n = 6–9 and n = 11–15; at n = 9, the 3 × 3 triangular grid meets the area lower bound and is provably optimal. For n = 10, the table uses the n = 9 grid plus one redundant piece as an initial baseline. All other instances are reconstructed from the published diagrams, with literature values and nine-decimal certificate scores listed separately.
SourceCurrent best solutions by n
Each parameter n is an independently scored sub-problem. Select any card to inspect the current record construction or submit a stronger solution.
Discussion (1) ↓Data and citation
All sub-problems in this family — authoritative scores, proof status, coordinates, and sources — are published at the stable URL below under CC BY 4.0. Because scores update as records fall, please cite the file's generatedAt timestamp.
GET https://minmaxarena.com/data/equilateral-triangles-covering-an-equilateral-triangle.json
Cite the frozen 2026-10 edition: live records change, whereas a frozen edition stays fixed and reproducible.
GET https://minmaxarena.com/data/editions/2026-10/equilateral-triangles-covering-an-equilateral-triangle.json
BibTeX (click to copy)
@misc{minmaxarena-equilateral-triangles-covering-an-equilateral-triangle-2026-10,
title = {{Covering an equilateral triangle with n equilateral triangles} (P77)},
author = {{MinMax Arena}},
year = {2026},
note = {Machine-verified records, 2026-10 edition},
url = {https://minmaxarena.com/data/editions/2026-10/equilateral-triangles-covering-an-equilateral-triangle.json},
license = {CC BY 4.0}
}Discussion
Discuss strategies, share construction methods, or ask questions. Any signed-in user can post under their public byline and unique #UID. New posts appear after moderation.
Grouped by player and sub-problem, showing the latest note first. Earlier versions and replies are preserved; click any note to read or reply. Notes can be published alongside record-breaking submissions.
No solver notes yet.