P01 · Packing and covering · Classic

Equal-circle packing in a unit square

Also known ascircle packing in a squarepacking equal circles in a unit squarecsq

1y0
0x1
VERIFIED CONSTRUCTIONr = 0.207106781
n = 5Current record · open

Place n non-overlapping circles of equal radius inside the unit square to maximize their common radius.

Formal definition

  • ContainerThe unit square [0, 1] × [0, 1], with lower-left corner (0, 0) and upper-right corner (1, 1)
  • SubmissionExactly n circles: one common radius and n center coordinates
  • ConstraintsEvery circle lies wholly inside the square; no two interiors overlap, and tangency is allowed
  • ObjectiveMaximize the common radius

Getting a feel for it

Contact graphs and irregular packings

At maximum radius, most circles are tangent to neighbors or the square boundary, forming a rigid contact network. Outside a few square numbers, regular grids waste space along the edges; better packings typically use tilted rows, staggered layers, and occasionally one or two rattlers that can move slightly inside a pocket.

Proven optima and open frontier

Mathematical optimality proofs are known for n = 1–30. For n = 31–300, the public best-known constructions from Packomania are imported; optimality remains open except at n = 36. Larger instances are grouped into a single table for algorithmic benchmarking.

Source
ONE LEADERBOARD PER n

Current best solutions by n

Smaller instances have dedicated visual pages for inspection and interactive editing, while larger n are consolidated in the index table below for direct comparison and submission.

Discussion (2) ↓
n1
CURRENT RECORD0.500000000
Optimal
Answer sourceReference answer
Solution methodPublished reference construction
n2
CURRENT RECORD(2 − √2)/2
Optimal
Answer sourceReference answer
Solution method—
n3
CURRENT RECORD0.254333094
Optimal
Answer sourcePackomania · Eckard Specht
Solution methodPublished reference construction
n4
CURRENT RECORD0.250000000
Optimal
Answer sourceReference answer
Solution methodPublished reference construction
n5
CURRENT RECORD(√2 − 1)/2
Optimal
Answer sourceReference answer
Solution methodPublished reference construction
n6
CURRENT RECORD0.187680601
Optimal
Answer sourcePackomania · Eckard Specht
Solution methodPublished reference construction
n7
CURRENT RECORD0.174457630
Optimal
Answer sourcePackomania · Eckard Specht
Solution methodPublished reference construction
n8
CURRENT RECORD0.170540688
Optimal
Answer sourcePackomania · Eckard Specht
Solution methodPublished reference construction
n9
CURRENT RECORD1/6
Optimal
Answer sourceReference answer
Solution methodPublished reference construction
n10
CURRENT RECORD0.148204322
Optimal
Answer sourcePackomania · Eckard Specht
Solution methodPublished reference construction
n11
CURRENT RECORD0.142399237
Optimal
Answer sourcePackomania · Eckard Specht
Solution methodPublished reference construction
n12
CURRENT RECORD0.139958843
Optimal
Answer sourcePackomania · Eckard Specht
Solution methodPublished reference construction
n13
CURRENT RECORD0.133993513
Optimal
Answer sourcePackomania · Eckard Specht
Solution methodPublished reference construction
n14
CURRENT RECORD0.129331793
Optimal
Answer sourcePackomania · Eckard Specht
Solution methodPublished reference construction
n15
CURRENT RECORD0.127166547
Optimal
Answer sourcePackomania · Eckard Specht
Solution methodPublished reference construction
n16
CURRENT RECORD0.125000000
Optimal
Answer sourceReference answer
Solution methodPublished reference construction
n17
CURRENT RECORD0.117196742
Optimal
Answer sourceReference answer
Solution method—
n18
CURRENT RECORD0.115521432
Optimal
Answer sourcePackomania · Eckard Specht
Solution methodPublished reference construction
n19
CURRENT RECORD0.112265437
Optimal
Answer sourcePackomania · Eckard Specht
Solution methodPublished reference construction
n20
CURRENT RECORD0.111382347
Optimal
Answer sourcePackomania · Eckard Specht
Solution methodPublished reference construction
n21
CURRENT RECORD0.106860212
Optimal
Answer sourcePackomania · Eckard Specht
Solution methodPublished reference construction
n22
CURRENT RECORD0.105665296
Optimal
Answer sourcePackomania · Eckard Specht
Solution methodPublished reference construction
n23
CURRENT RECORD0.102802323
Optimal
Answer sourcePackomania · Eckard Specht
Solution methodPublished reference construction
n24
CURRENT RECORD0.101381800
Optimal
Answer sourcePackomania · Eckard Specht
Solution methodPublished reference construction
n25
CURRENT RECORD1/10
Optimal
Answer sourcePackomania · Eckard Specht
Solution methodPublished reference construction
n26
CURRENT RECORD0.096362338
Optimal
Answer sourcePackomania · Eckard Specht
Solution methodPublished reference construction
n27
CURRENT RECORD0.095420001
Optimal
Answer sourcePackomania · Eckard Specht
Solution methodPublished reference construction
n28
CURRENT RECORD0.093672833
Optimal
Answer sourcePackomania · Eckard Specht
Solution methodPublished reference construction
n29
CURRENT RECORD0.092463143
Optimal
Answer sourcePackomania · Eckard Specht
Solution methodPublished reference construction
n30
CURRENT RECORD0.091671057
Optimal
Answer sourcePackomania · Eckard Specht
Solution methodPublished reference construction
COMPUTATIONAL FRONTIER

N = 31–300 index

Each row is an independently scored sub-problem. External benchmarks retain their published precision, while arena constructions are verified on the exact nine-decimal grid.

NCURRENT RECORDKNOWN BESTRECORD SOURCESTATUS
360.0833333331/12 ↗Packomania · Eckard SpechtOptimalClosed

Data and citation

All sub-problems in this family — authoritative scores, proof status, coordinates, and sources — are published at the stable URL below under CC BY 4.0. Because scores update as records fall, please cite the file's generatedAt timestamp.

GET https://minmaxarena.com/data/square-circle-packing.json

Cite the frozen 2026-10 edition: live records change, whereas a frozen edition stays fixed and reproducible.

GET https://minmaxarena.com/data/editions/2026-10/square-circle-packing.json
BibTeX (click to copy)
@misc{minmaxarena-square-circle-packing-2026-10,
  title  = {{Equal-circle packing in a unit square} (P01)},
  author = {{MinMax Arena}},
  year   = {2026},
  note   = {Machine-verified records, 2026-10 edition},
  url    = {https://minmaxarena.com/data/editions/2026-10/square-circle-packing.json},
  license = {CC BY 4.0}
}
DISCUSSION

Discussion

Discuss strategies, share construction methods, or ask questions. Any signed-in user can post under their public byline and unique #UID. New posts appear after moderation.