Equilateral triangles in a square · n = 32
Pack n unit-side equilateral triangles into a square. Contact is allowed; interiors cannot overlap. Minimise the container square side.
Instancen = 32
ObjectiveMinimize container square side
Best known, unproven3.97880Source-precision interval: 3.9788–3.97881 (values inside match)exhibited site certificate 3.978800452Compiled by Erich Friedman; 32. Found by Jake Loyd in June 2026. Source expression: s = 3.97880+.
Formal definition
- ContainerThe editor and certificate normalize to the unit square [0,1]². This is a coordinate convention only; scores use the literature's unit-piece scale. Boundary contact is allowed.
- SubmissionSubmit {radius, placements:[{x,y,turn},…]}, with decimal strings of at most nine places. x,y are centres; circles require turn=0, polygons use turn=tan(θ/2). Coordinates and turn lie in ±4; 0 < radius ≤ 4.
- ConstraintsExactly n congruent shapes lie wholly in the container with pairwise disjoint interiors. Polygon rotations are independent, not limited to quarter turns.
- PrecisionInput decimals are exact rationals; regular-polygon vertices are algebraic, not rounded templates. Feasibility has no floating-point tolerance. A finite-decimal certificate is not a continuous optimality proof.
- Objectivecontainer square side = 1/(2 sin(pi/3) r), smaller is better. Pages, leaderboards and literature share these units; conversion is automatic.
