P67 · Packing and covering · Classic · Applied frontier

Variable-radius circles in a fixed-perimeter rectangle

Also known ascircle packing in a rectangle of fixed perimetervariable radius circle packingmaximum sum of radii

1.054499721y0
0x0.945500279
VERIFIED CONSTRUCTIONscored by the sum of the radii
n = 26Current record · open

Place n circles with disjoint interiors in a rectangle of perimeter 4. Both the rectangle's dimensions and every radius may vary; maximize the sum of the radii.

Formal definition

  • Containerwidth>0, height>0, and width+height=2; the lower-left corner is fixed at (0,0)
  • SubmissionExactly n circles, each written [x,y,r], with strictly positive radius
  • ConstraintsEvery circle lies wholly inside the rectangle; interiors are pairwise disjoint and tangency is allowed
  • ObjectiveMaximize the exact integer sum of all radii

Getting a feel for it

Optimizing container and cargo together

With a fixed square only the circles move. Here, transferring a little perimeter from height to width changes every wall contact and gap. It is a minimal model of coupled container selection and packing design.

Why uniformity loses

Equal radii usually waste the gaps between curved boundaries. Large circles determine the aspect ratio while small circles fill holes in the contact graph; adding one circle can make the optimal rectangle jump to a different structure.

Published frontier

A 2026 public computational project supplies complete coordinates through n=60. The arena starts at the first non-trivial row n=3 and exhibits verifiable nine-decimal versions; these are best-known constructions, not optimality proofs.

Source
ONE LEADERBOARD PER n

Current best solutions by n

Each n is an independent record with a page of its own. Open any of them to inspect the current construction, then challenge it.

Discussion (0) ↓
n3
CURRENT RECORD0.813965434best known 0.813965434
Matches the best known
Answer sourceTimo Berthold, Dominik Kamp, Gonzalo Mexi, Sebastian Pokutta and Ilja Polik
Solution methodPublished reference construction
View problem
n4
CURRENT RECORD1.006788468best known 1.006788468
Matches the best known
Answer sourceTimo Berthold, Dominik Kamp, Gonzalo Mexi, Sebastian Pokutta and Ilja Polik
Solution methodPublished reference construction
View problem
n5
CURRENT RECORD1.112261797best known 1.112261797
Matches the best known
Answer sourceTimo Berthold, Dominik Kamp, Gonzalo Mexi, Sebastian Pokutta and Ilja Polik
Solution methodPublished reference construction
View problem
n6
CURRENT RECORD1.212458612best known 1.212458612
Matches the best known
Answer sourceTimo Berthold, Dominik Kamp, Gonzalo Mexi, Sebastian Pokutta and Ilja Polik
Solution methodPublished reference construction
View problem
n7
CURRENT RECORD1.324288805best known 1.324288805
Matches the best known
Answer sourceTimo Berthold, Dominik Kamp, Gonzalo Mexi, Sebastian Pokutta and Ilja Polik
Solution methodPublished reference construction
View problem
n8
CURRENT RECORD1.430221717best known 1.430221717
Matches the best known
Answer sourceTimo Berthold, Dominik Kamp, Gonzalo Mexi, Sebastian Pokutta and Ilja Polik
Solution methodPublished reference construction
View problem
n9
CURRENT RECORD1.528312759best known 1.528312759
Matches the best known
Answer sourceTimo Berthold, Dominik Kamp, Gonzalo Mexi, Sebastian Pokutta and Ilja Polik
Solution methodPublished reference construction
View problem
n10
CURRENT RECORD1.610004223best known 1.610004223
Matches the best known
Answer sourceTimo Berthold, Dominik Kamp, Gonzalo Mexi, Sebastian Pokutta and Ilja Polik
Solution methodPublished reference construction
View problem
n11
CURRENT RECORD1.685206461best known 1.685206461
Matches the best known
Answer sourceTimo Berthold, Dominik Kamp, Gonzalo Mexi, Sebastian Pokutta and Ilja Polik
Solution methodPublished reference construction
View problem
n12
CURRENT RECORD1.765978304best known 1.765978304
Matches the best known
Answer sourceTimo Berthold, Dominik Kamp, Gonzalo Mexi, Sebastian Pokutta and Ilja Polik
Solution methodPublished reference construction
View problem
n13
CURRENT RECORD1.835020065best known 1.835020065
Matches the best known
Answer sourceTimo Berthold, Dominik Kamp, Gonzalo Mexi, Sebastian Pokutta and Ilja Polik
Solution methodPublished reference construction
View problem
n14
CURRENT RECORD1.916657209best known 1.916657209
Matches the best known
Answer sourceTimo Berthold, Dominik Kamp, Gonzalo Mexi, Sebastian Pokutta and Ilja Polik
Solution methodPublished reference construction
View problem
n15
CURRENT RECORD1.985786444best known 1.985786444
Matches the best known
Answer sourceTimo Berthold, Dominik Kamp, Gonzalo Mexi, Sebastian Pokutta and Ilja Polik
Solution methodPublished reference construction
View problem
n16
CURRENT RECORD2.059275718best known 2.059275718
Matches the best known
Answer sourceTimo Berthold, Dominik Kamp, Gonzalo Mexi, Sebastian Pokutta and Ilja Polik
Solution methodPublished reference construction
View problem
n17
CURRENT RECORD2.117334907best known 2.117334907
Matches the best known
Answer sourceTimo Berthold, Dominik Kamp, Gonzalo Mexi, Sebastian Pokutta and Ilja Polik
Solution methodPublished reference construction
View problem
n18
CURRENT RECORD2.1809143best known 2.1809143
Matches the best known
Answer sourceTimo Berthold, Dominik Kamp, Gonzalo Mexi, Sebastian Pokutta and Ilja Polik
Solution methodPublished reference construction
View problem
n19
CURRENT RECORD2.24156519best known 2.24156519
Matches the best known
Answer sourceTimo Berthold, Dominik Kamp, Gonzalo Mexi, Sebastian Pokutta and Ilja Polik
Solution methodPublished reference construction
View problem
n20
CURRENT RECORD2.305713814best known 2.305713814
Matches the best known
Answer sourceTimo Berthold, Dominik Kamp, Gonzalo Mexi, Sebastian Pokutta and Ilja Polik
Solution methodPublished reference construction
View problem
n21
CURRENT RECORD2.365832315best known 2.365832315
Matches the best known
Answer sourceTimo Berthold, Dominik Kamp, Gonzalo Mexi, Sebastian Pokutta and Ilja Polik
Solution methodPublished reference construction
View problem
n22
CURRENT RECORD2.425137213best known 2.425137213
Matches the best known
Answer sourceTimo Berthold, Dominik Kamp, Gonzalo Mexi, Sebastian Pokutta and Ilja Polik
Solution methodPublished reference construction
View problem
n23
CURRENT RECORD2.484239482best known 2.484239482
Matches the best known
Answer sourceTimo Berthold, Dominik Kamp, Gonzalo Mexi, Sebastian Pokutta and Ilja Polik
Solution methodPublished reference construction
View problem
n24
CURRENT RECORD2.53534404best known 2.53534404
Matches the best known
Answer sourceTimo Berthold, Dominik Kamp, Gonzalo Mexi, Sebastian Pokutta and Ilja Polik
Solution methodPublished reference construction
View problem
n25
CURRENT RECORD2.592537635best known 2.592537635
Matches the best known
Answer sourceTimo Berthold, Dominik Kamp, Gonzalo Mexi, Sebastian Pokutta and Ilja Polik
Solution methodPublished reference construction
View problem
n26
CURRENT RECORD2.639308106best known 2.639308106
Matches the best known
Answer sourceTimo Berthold, Dominik Kamp, Gonzalo Mexi, Sebastian Pokutta and Ilja Polik
Solution methodPublished reference construction
View problem
n27
CURRENT RECORD2.690155069best known 2.690155069
Matches the best known
Answer sourceTimo Berthold, Dominik Kamp, Gonzalo Mexi, Sebastian Pokutta and Ilja Polik
Solution methodPublished reference construction
View problem
n28
CURRENT RECORD2.737084314best known 2.737084314
Matches the best known
Answer sourceTimo Berthold, Dominik Kamp, Gonzalo Mexi, Sebastian Pokutta and Ilja Polik
Solution methodPublished reference construction
View problem
n29
CURRENT RECORD2.790292073best known 2.790292073
Matches the best known
Answer sourceTimo Berthold, Dominik Kamp, Gonzalo Mexi, Sebastian Pokutta and Ilja Polik
Solution methodPublished reference construction
View problem
n30
CURRENT RECORD2.843145768best known 2.843145768
Matches the best known
Answer sourceTimo Berthold, Dominik Kamp, Gonzalo Mexi, Sebastian Pokutta and Ilja Polik
Solution methodPublished reference construction
View problem

Data and citation

Every sub-problem in this family — authoritative scores, proof status, coordinates and sources — lives at the stable address below, published under CC BY 4.0. Scores move as records fall, so cite the generatedAt timestamp the file carries.

GET https://minmaxarena.com/data/variable-circles-in-fixed-perimeter-rectangle.json

The first frozen edition is published at the start of next month; until then, cite with the date you accessed it.

BibTeX (click to copy)
@misc{minmaxarena-variable-circles-in-fixed-perimeter-rectangle,
  title  = {{Variable-radius circles in a fixed-perimeter rectangle} (P67)},
  author = {{MinMax Arena}},
  year   = {2026},
  note   = {Machine-verified records, accessed 2026-08-29},
  url    = {https://minmaxarena.com/problems/variable-circles-in-fixed-perimeter-rectangle},
  license = {CC BY 4.0}
}
DISCUSSION

Discussion

Talk strategy, share methods, ask why you are stuck. Posts carry your public byline, the same name your records use; the #number after it is the account's signup ordinal, so a name cannot be worn by someone else. The floor is earned: break a record once, anywhere, and it is yours for good. New posts appear after an automated review.

No threads yet. Be the first to talk about this problem?