Squares in an equilateral triangle · n = 38
Pack n unit-side squares into a equilateral triangle. Contact is allowed; interiors cannot overlap. Minimise the container triangle side.
Instancen = 38
ObjectiveMinimize container triangle side
Best known, unproven10.304Source-precision interval: 10.304–10.305 (values inside match)Compiled by Erich Friedman; Found by Gianluca Costantino in April 2026. Source expression: s = 10.304+.
The external best-known value is cited above; its layout is not reproduced here. The starting layout is an ordinary site baseline, not the external record.
Formal definition
- ContainerThe editor and certificate normalize to the equilateral triangle with vertices (0,0), (1,0), (1/2,√3/2). 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 triangle side = 1/(2 sin(pi/4) r), smaller is better. Pages, leaderboards and literature share these units; conversion is automatic.
