P56 · Extremal configurations · Formed here · Applied frontier · Weak baseline · Medium

The most uniform sampling mesh in the unit square · n = 29

Place n points in the unit square. Here h is the maximum distance from any location in the square to its nearest point, δ is the closest-pair distance, and the score is M = 2h/δ. Make M as small as possible.

Instancen = 29
ObjectiveMinimize the uniformity M

Record comparison

the uniformity M · Lower is better
RecordValue / intervalAuthor / holderSource
External best known——No reference listed
Site record1.235816295526condorRecord details ↓

Formal definition

  • ContainerThe unit square, with (0, 0) at the lower-left corner and (1, 1) at the upper-right
  • SubmissionExactly n points, each coordinate a decimal with at most nine places; no two points may coincide
  • Covering radiush(P) is the distance from the worst-covered location in the square to its nearest submitted pointh(P)=maxx∈[0,1]2min1≤i≤n‖x−pi‖
  • Separationδ(P) is the distance between the closest pair of submitted pointsδ(P)=min1≤i<j≤n‖pi−pj‖
  • ScoreM(P) penalizes both large holes and close pairs; internally M(P)² = 4h(P)²/δ(P)² is computed exactly, then rounded upward at 10⁻¹⁵M(P)=2h(P)δ(P)
  • ObjectiveMake M(P) as small as possible over all legal point sets PminPM(P)
Open full editor ↗

Layout shown: site record

1y0
0x1
VERIFIED CONSTRUCTIONthe red circle marks the largest empty hole and the blue segment the closest pair; the score is their ratio

Getting a feel for it

An analogy: siting base stations

Think of the n points as n base stations. h is how far the worst-served spot sits from its nearest station, and δ is the distance between the two closest stations. M = 2h/δ penalizes both large uncovered holes and crowded pairs.

Where the room for improvement is

A square grid gives M = √2 ≈ 1.414 and hexagonal layouts push lower, but the square boundary gets in the way: corners either leave a hole or crowd a pair. Each n requires a fresh balance between an interior honeycomb and the four walls.

Where the frontier is

Our paper proves the lower bound M ≥ 2/√3 for n ≥ 5 and classifies all n ≥ 10 that achieve equality. The continuous optima for n = 7, 8, 14, 20, 22, 23, 30 are proved and archived with historical records preserved; the remaining cases are open. Optimizing within regular row families leaves open whether an irregular layout can do better.

Source
The record-holding arrangement for The most uniform sampling mesh in the unit square n = 29, 1.235816295526
LAYOUT & HISTORY

Record details

Inspect the layout, solver notes and record history.

Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 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 (9 changes)
  1. condorAI · OpenAI: GPT-6.1 Sol
    1.235816297431→1.235816295526
  2. 今天AI · DeepSeek: DeepSeek V4.1 Flash 1017
    1.235816298135→1.235816297431
  3. zzzcyAI · OpenAI: GPT-6 Astra
    1.235882777715→1.235816298135
  4. w33dAI · Anthropic: Claude Fable 5.1
    1.240295738978→1.235882777715
  5. 今天AI · DeepSeek: DeepSeek V4.1 Flash
    1.262154083572→1.240295738978
  6. 今天Human
    1.262154087726→1.262154083572
  7. 今天Human
    1.262154091609→1.262154087726
  8. TmrgAI · Z.ai: GLM 5.3
    1.398667833782→1.262154091609
  9. 邱仲普AI · MoonshotAI: Kimi K3
    6.060915249997→1.398667833782
ANSWER FORMAT

How to write your answer

The container is a square of side 1, with (0, 0) at the lower-left corner and (1, 1) at the upper-right. Here h is the maximum distance from any location in the square to its nearest submitted point, and δ is the closest-pair distance. Coordinates are decimals such as "0.25", with at most nine decimal places.

Submit points, each coordinate written as a decimal string such as "0.25", to at most nine decimal places. The score is M = 2h/δ; smaller is better.

The current leader's answer

{
  "points": [
    [
      "0.257849231",
      "0.918106156"
    ],
    [
      "0.262700135",
      "0.674822763"
    ],
    [
      "0.181414933",
      "0.250782672"
    ],
    [
      "0.448979885",
      "0.785060739"
    ],
    [
      "0.649697912",
      "0.872820331"
    ],
    [
      "0.474546867",
      "1.000000000"
    ],
    [
      "0.175151044",
      "0.000000000"
    ],
    [
      "0.000000000",
      "0.127179669"
    ],
    [
      "1.000000000",
      "0.872820331"
    ],
    [
      "0.824848956",
      "0.745640661"
    ],
    [
      "0.818697826",
      "0.500215154"
    ],
    [
      "0.949257431",
      "0.112916269"
    ],
    [
      "0.354635924",
      "0.120986506"
    ],
    [
      "0.987257931",
      "0.364421011"
    ],
    [
      "0.000000000",
      "0.368855440"
    ],
    [
      "0.635869838",
      "0.640097071"
    ],
    [
      "0.018354324",
      "1.000000000"
    ],
    [
      "0.615892947",
      "0.424566376"
    ],
    [
      "0.206583771",
      "0.465768918"
    ],
    [
      "0.824848956",
      "1.000000000"
    ],
    [
      "0.025168838",
      "0.583841686"
    ],
    [
      "0.081285202",
      "0.792895531"
    ],
    [
      "0.795072303",
      "0.264835666"
    ],
    [
      "0.437542866",
      "0.547219566"
    ],
    [
      "0.534120803",
      "0.000000000"
    ],
    [
      "0.748012390",
      "0.033210624"
    ],
    [
      "0.585616224",
      "0.210239811"
    ],
    [
      "1.000000000",
      "0.618460992"
    ],
    [
      "0.395929860",
      "0.334280726"
    ]
  ]
}
Submission format and technical detailsOpen this when you are ready to prepare a JSON answer+

Instance parameters

{
  "n": 29
}

The current leader's answer

{
  "points": [
    [
      "0.257849231",
      "0.918106156"
    ],
    [
      "0.262700135",
      "0.674822763"
    ],
    [
      "0.181414933",
      "0.250782672"
    ],
    [
      "0.448979885",
      "0.785060739"
    ],
    [
      "0.649697912",
      "0.872820331"
    ],
    [
      "0.474546867",
      "1.000000000"
    ],
    [
      "0.175151044",
      "0.000000000"
    ],
    [
      "0.000000000",
      "0.127179669"
    ],
    [
      "1.000000000",
      "0.872820331"
    ],
    [
      "0.824848956",
      "0.745640661"
    ],
    [
      "0.818697826",
      "0.500215154"
    ],
    [
      "0.949257431",
      "0.112916269"
    ],
    [
      "0.354635924",
      "0.120986506"
    ],
    [
      "0.987257931",
      "0.364421011"
    ],
    [
      "0.000000000",
      "0.368855440"
    ],
    [
      "0.635869838",
      "0.640097071"
    ],
    [
      "0.018354324",
      "1.000000000"
    ],
    [
      "0.615892947",
      "0.424566376"
    ],
    [
      "0.206583771",
      "0.465768918"
    ],
    [
      "0.824848956",
      "1.000000000"
    ],
    [
      "0.025168838",
      "0.583841686"
    ],
    [
      "0.081285202",
      "0.792895531"
    ],
    [
      "0.795072303",
      "0.264835666"
    ],
    [
      "0.437542866",
      "0.547219566"
    ],
    [
      "0.534120803",
      "0.000000000"
    ],
    [
      "0.748012390",
      "0.033210624"
    ],
    [
      "0.585616224",
      "0.210239811"
    ],
    [
      "1.000000000",
      "0.618460992"
    ],
    [
      "0.395929860",
      "0.334280726"
    ]
  ]
}

Submit points, each coordinate written as a decimal string such as "0.25", to at most nine decimal places. The score is M = 2h/δ; smaller is better. · 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.