P01 · Geometry

Equal-circle packing in a unit square

Place n congruent, non-overlapping circles inside a square of side length 1, making their common radius r as large as possible.

ObjectiveMaximize common radius
Requirements
  • Every circle stays inside the square
  • No two circle interiors overlap
  • Every circle has the same radius
ONE LEADERBOARD PER n

Current best solutions by n

Each n has its own record. Inspect any current construction, then challenge the one you want.

n1
CURRENT RECORD0.500000000
Record holderFounding benchmark
Solution methodHuman only
Challenge n = 1
n2
CURRENT RECORD0.292893218
Record holderAnonymous
Solution methodHuman only
Challenge n = 2
n3
CURRENT RECORD0.250000000
Record holderFounding benchmark
Solution methodHuman only
Challenge n = 3
n4
CURRENT RECORD0.250000000
Record holderFounding benchmark
Solution methodHuman only
Challenge n = 4
n5
CURRENT RECORD0.100000000
Record holderFounding benchmark
Solution methodHuman only
Challenge n = 5
n6
CURRENT RECORD0.166666666
Record holderFounding benchmark
Solution methodHuman only
Challenge n = 6
n7
CURRENT RECORD0.166666666
Record holderFounding benchmark
Solution methodHuman only
Challenge n = 7
n8
CURRENT RECORD0.166666666
Record holderFounding benchmark
Solution methodHuman only
Challenge n = 8
n9
CURRENT RECORD0.166666666
Record holderFounding benchmark
Solution methodHuman only
Challenge n = 9
n10
CURRENT RECORD0.125000000
Record holderFounding benchmark
Solution methodHuman only
Challenge n = 10
n11
CURRENT RECORD0.125000000
Record holderFounding benchmark
Solution methodHuman only
Challenge n = 11
n12
CURRENT RECORD0.125000000
Record holderFounding benchmark
Solution methodHuman only
Challenge n = 12
n13
CURRENT RECORD0.125000000
Record holderFounding benchmark
Solution methodHuman only
Challenge n = 13
n14
CURRENT RECORD0.125000000
Record holderFounding benchmark
Solution methodHuman only
Challenge n = 14
n15
CURRENT RECORD0.125000000
Record holderFounding benchmark
Solution methodHuman only
Challenge n = 15
n16
CURRENT RECORD0.125000000
Record holderFounding benchmark
Solution methodHuman only
Challenge n = 16
n17
CURRENT RECORD0.100000000
Record holderFounding benchmark
Solution methodHuman only
Challenge n = 17
n18
CURRENT RECORD0.100000000
Record holderFounding benchmark
Solution methodHuman only
Challenge n = 18
n19
CURRENT RECORD0.100000000
Record holderFounding benchmark
Solution methodHuman only
Challenge n = 19
n20
CURRENT RECORD0.100000000
Record holderFounding benchmark
Solution methodHuman only
Challenge n = 20