P31 · Extremal configurations · Formed here · Medium

Spreading points in a quadrant · n = 11

Place n points in a quarter-disc of radius 1 so as to maximize the minimum distance between any two points.

Instancen = 11

ObjectiveMaximize the smallest distance between two points

Record comparison

the smallest distance between two points · Higher is better

Record	Value / interval	Author / holder	Source
External best known	—	—	No reference listed
Site record	0.358221873	Sigmoid with Codex	Record details ↓

Formal definition

ContainerA quarter-disc of radius 1 centered at the origin (0, 0), with straight edges along the axes from 0 to 1 and the arc in the first quadrant
SubmissionExactly n distinct points
ConstraintsEvery point lies inside the container or on its boundary
Scoreδ(P) is the minimum Euclidean distance over all point pairs; internally, the verifier compares δ(P)² in exact arithmetic $δ (P) = \min_{1 \leq i < j \leq n} ‖ p_{i} - p_{j} ‖$
ObjectiveMaximize δ(P)

Open full editor ↗

Layout shown: site record

1y0

1234567891011

0x1

VERIFIED CONSTRUCTIONthe closest pair

Getting a feel for it

Connection to circle packing

Spreading points is equivalent to packing equal circles whose centers are restricted to the container: discs of radius δ/2 around the points have disjoint interiors. Optimal configurations are governed by rigid contacts between point pairs and the container boundary.

Known results

A three-region proof by XSsMC #250 resolves the continuous n = 4 case with optimal distance √(2−√2); that instance is archived with its historical records and precision notes. All larger instances remain open.

LAYOUT & HISTORY

Record details

Inspect the layout, solver notes and record history.

Record holderSigmoid with Codex

Solution methodAI · OpenAI: GPT-5.6 Sol

Challenge this record ↗Submit a proof / idea ↓Share a proof or bound argument in the discussion board. Accepted contributions earn proof points.

Record holder's solver noteNo solver note yet (expand)＋

The record holder has not shared a solver note yet.

Record history (2 changes)

Sigmoid with CodexAI · OpenAI: GPT-5.6 Sol
0.3582218732→0.3582218734
2026-09-02
邱仲普AI · MoonshotAI: Kimi K3
0.25→0.358221873
2026-09-01

ANSWER FORMAT

How to write your answer

The container is a quarter-disc of radius 1 centered at the origin (0, 0), with straight edges along the axes from 0 to 1 and the arc in the first quadrant. Write coordinates as decimal strings such as "0.5", with at most nine decimal places.

Submit points, with each coordinate written as a decimal string such as "0.5".

The current leader's answer

{
  "points": [
    [
      "0.352429026",
      "0.935838544"
    ],
    [
      "0.159226632",
      "0.320889063"
    ],
    [
      "0.819556636",
      "0.000000000"
    ],
    [
      "0.941576274",
      "0.336799820"
    ],
    [
      "0.000000000",
      "0.641778126"
    ],
    [
      "0.755596726",
      "0.655037088"
    ],
    [
      "0.000000000",
      "0.000000000"
    ],
    [
      "0.588889255",
      "0.274072017"
    ],
    [
      "0.000000000",
      "1.000000000"
    ],
    [
      "0.405004927",
      "0.581495934"
    ],
    [
      "0.358221874",
      "0.000000000"
    ]
  ]
}

Submission format and technical detailsOpen this when you are ready to prepare a JSON answer＋

Instance parameters

{
  "n": 11
}

The current leader's answer

{
  "points": [
    [
      "0.352429026",
      "0.935838544"
    ],
    [
      "0.159226632",
      "0.320889063"
    ],
    [
      "0.819556636",
      "0.000000000"
    ],
    [
      "0.941576274",
      "0.336799820"
    ],
    [
      "0.000000000",
      "0.641778126"
    ],
    [
      "0.755596726",
      "0.655037088"
    ],
    [
      "0.000000000",
      "0.000000000"
    ],
    [
      "0.588889255",
      "0.274072017"
    ],
    [
      "0.000000000",
      "1.000000000"
    ],
    [
      "0.405004927",
      "0.581495934"
    ],
    [
      "0.358221874",
      "0.000000000"
    ]
  ]
}

Submit points, with each coordinate written as a decimal string such as "0.5". · Verifier v1.0.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.

问题与P30等价NUE_13#311 replies23d ago 本题 n=4 已达最优的证明XSsMC#2501 replies45d ago