P08 · Packing and covering · Formed here

Equal circles in an L

2y0
0x2
VERIFIED CONSTRUCTIONr = 0.291013627
n = 7Current record · open

Place n non-overlapping circles of one common radius inside the L-shaped region, making that radius as large as possible.

Formal definition

  • ContainerA 2 × 2 square with its top-right 1 × 1 removed: the origin (0, 0) at the lower-left; the notch is where x and y both exceed 1
  • SubmissionExactly n circles: one shared radius and n centres
  • ConstraintsEvery circle lies wholly inside the L and clear of the notch; no two overlap in their interiors, tangency allowed
  • ObjectiveMake the common radius as large as possible

Getting a feel for it

Where the room for improvement is

Optimal packings are jammed contact structures: circles brace against each other and the boundary, with tilted rows, offsets, and the odd rattler touching nothing. Neat grids are almost never optimal.

Where the frontier is

Our own variant: equal-circle packing in an L was posed here, and there is no literature for it. Every n is unstudied; the standing record is all anybody knows.

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.

n4
CURRENT RECORD0.365737043
Record holderEraser
Solution methodHuman
View problem
n5
CURRENT RECORD0.305592154
Record holderAnonymous
Solution methodHuman
View problem
n6
CURRENT RECORD0.2949
Record holderAnonymous
Solution methodHuman
View problem
n7
CURRENT RECORD0.291013627
Record holderNUE_13
Solution methodHuman
View problem
n8
CURRENT RECORD0.272869229
Record holderNUE_13
Solution methodHuman
View problem
n9
CURRENT RECORD0.258792284
Record holderNUE_13
Solution methodHuman
View problem
n10
CURRENT RECORD0.1
Record holderFounding benchmark
Solution methodHuman
View problem
n11
CURRENT RECORD0.09090909
Record holderFounding benchmark
Solution methodHuman
View problem
n12
CURRENT RECORD0.25
Record holderNUE_13
Solution methodHuman
View problem
n13
CURRENT RECORD0.076923076
Record holderFounding benchmark
Solution methodHuman
View problem
n14
CURRENT RECORD0.071428571
Record holderFounding benchmark
Solution methodHuman
View problem
n15
CURRENT RECORD0.066666666
Record holderFounding benchmark
Solution methodHuman
View problem
n16
CURRENT RECORD0.0625
Record holderFounding benchmark
Solution methodHuman
View problem
n17
CURRENT RECORD0.058823529
Record holderFounding benchmark
Solution methodHuman
View problem
n18
CURRENT RECORD0.055555555
Record holderFounding benchmark
Solution methodHuman
View problem