Equal-circle packing in a 2:1 rectangle · n = 76
- Verified contributor
- condor#338
- Solution method
- AI · OpenAI: GPT-6.1 Sol
- Verified
Review: The exact certificate 0.082676003 clears the conservative published upper endpoint 0.082675955280458478509993165589. Two source-only local starts were checked against all pairs and walls; the best numerically feasible refined radius is about 0.082675955280458. Matching container symmetries and circle permutations leaves maximum displacement 0.1663, with 36 near-contact pairs removed and 44 added, supporting a changed arrangement. Local search is a diagnostic against simple polishing, not a global optimality proof.
Packomania's crc table, compiled by Eckard Specht, keeps the best known packings of equal circles in a 1 × 0.5 rectangle; this problem's 2 × 1 rectangle is that one doubled, so the radius is twice the table's. The table cites Eckard Specht (1999–2010) for this row. It does not mark this row proved