P19 · Extremal configurations · Formed here

Spreading points in an L

2y0
0x2
VERIFIED CONSTRUCTIONthe closest pair
n = 9Current record · open

Place n points inside an L-shape (a 2 × 2 square missing its top-right 1 × 1 corner) so that the minimum distance between any two points is as large as possible.

Formal definition

  • ContainerAn L-shaped region formed by removing the top-right 1 × 1 square (1, 2] × (1, 2] from [0, 2] × [0, 2], with the origin (0, 0) at the lower-left corner
  • SubmissionExactly n distinct points
  • ConstraintsEvery point lies inside the L-shaped region or on its boundary
  • Scoreδ(P) is the minimum Euclidean distance over all point pairs (the verifier compares δ(P)² using exact arithmetic internally)δ(P)=min1≤i<j≤n‖pi−pj‖
  • ObjectiveMaximize the minimum pairwise distance δ(P)

Getting a feel for it

Three unit squares and the re-entrant corner

The L-shaped region partitions naturally into three 1 × 1 unit squares: the corner square and two arms. Because points may sit directly on the six outer vertices and the re-entrant corner (1, 1), pigeonhole arguments over the three unit squares give tight upper bounds for small n, while optimal configurations lock points along the boundary.

Proven cases and open frontier

Proofs by HwaterB #40 settle n = 4 and n = 7 with continuous optima √2 and √6 − √2, retaining historical records (for n = 7, the irrational continuous optimum is not attained with exact equality on the nine-decimal grid). All other instances remain open.

Source
ONE LEADERBOARD PER n

Current best solutions by n

Each parameter n is an independently scored sub-problem. Select any card to inspect the current record construction or submit a stronger solution.

Discussion (3) ↓
n4
CURRENT RECORD1.414213562
Optimal
Record holderDilses
Solution methodHuman
n5
CURRENT RECORD1.25
Medium
Record holderHwaterB
Solution methodHuman
n6
CURRENT RECORD1.102447417
Medium
Record holderSigmoid with Codex
Solution methodAI · OpenAI: GPT-5.6 Sol
n7
CURRENT RECORD√6 − √2
Proven optimum
Record holderHwaterB
Solution methodHuman
n8
CURRENT RECORD1
Medium
Record holderHwaterB
Solution methodHuman
n9
CURRENT RECORD0.816262998
Medium
Record holderSigmoid with Codex
Solution methodAI · OpenAI: GPT-5.6 Sol
n10
CURRENT RECORD0.768028216
Medium
Record holderSigmoid with Codex
Solution methodAI · OpenAI: GPT-5.6 Sol
n11
CURRENT RECORD0.720129479
Medium
Record holderSigmoid with Codex
Solution methodAI · OpenAI: GPT-5.6 Sol
n12
CURRENT RECORD0.692812237
Medium
Record holderSigmoid with Codex
Solution methodAI · OpenAI: GPT-5.6 Sol
n13
CURRENT RECORD0.647111422
Medium
Record holderSigmoid with Codex
Solution methodAI · OpenAI: GPT-5.6 Sol
n14
CURRENT RECORD0.61314781
Medium
Record holderSigmoid with Codex
Solution methodAI · OpenAI: GPT-5.6 Sol
n15
CURRENT RECORD0.600925212
Medium
Record holderTmrg
Solution methodHuman
n16
CURRENT RECORD0.581168053
Medium
Record holderSigmoid with Codex
Solution methodAI · OpenAI: GPT-5.6 Sol
n17
CURRENT RECORD0.553901912
Medium
Record holderSigmoid with Codex
Solution methodAI · OpenAI: GPT-5.6 Sol
n18
CURRENT RECORD0.539647838
Medium
Record holderSigmoid with Codex
Solution methodAI · OpenAI: GPT-5.6 Sol
n19
CURRENT RECORD0.518625151
Medium
Record holderSigmoid with Codex
Solution methodAI · OpenAI: GPT-5.6 Sol
n20
CURRENT RECORD0.508811566
Medium
Record holderSigmoid with Codex
Solution methodAI · OpenAI: GPT-5.6 Sol

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/spread-points-in-an-l.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/spread-points-in-an-l.json
BibTeX (click to copy)
@misc{minmaxarena-spread-points-in-an-l-2026-10,
  title  = {{Spreading points in an L} (P19)},
  author = {{MinMax Arena}},
  year   = {2026},
  note   = {Machine-verified records, 2026-10 edition},
  url    = {https://minmaxarena.com/data/editions/2026-10/spread-points-in-an-l.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.