Covering a square with n equilateral triangles · n = 8
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 protrude
- 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 better
- ObjectiveMinimise s over all legal covers