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
Record comparison
container square side · Lower is better| Record | Value / interval | Author / holder | Source |
|---|---|---|---|
| External best known | [3.9788, 3.97881) | 32. Found by Jake Loyd | Erich Friedman ↗ |
| Site record | No player record yet | — | — |
Formal definition
- ContainerThe editor and certificate normalise the container to the unit square [0,1]², while public scores are reported in the literature's unit-piece scale. Boundary contact is allowed.
- SubmissionSubmit {radius, placements:[{x,y,turn},…]}, with each value written as a decimal string of at most nine places. Here x, y are centre coordinates; circles require turn = 0 and polygons use turn = tan(θ/2). Coordinates and turn must lie in [−4, 4], with 0 < radius ≤ 4.
- ConstraintsExactly n congruent pieces lie wholly inside the container with pairwise disjoint interiors. Polygons may rotate independently by arbitrary angles.
- PrecisionInput decimals are parsed as exact rationals and regular-polygon vertices are defined algebraically, with zero floating-point tolerance in feasibility checks.
- ObjectiveContainer square side = 1/(2 sin(π/3) r), where smaller is better. Pages, leaderboards, and literature records share this unit with automatic conversion.
