MinMax Arena
中/EN
P56 · Extremal configurations · Formed here · Applied frontier · Weak baseline

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

Place n points in the unit square. h is the greatest distance any location has to its nearest point, δ the distance of the closest pair; the score is M = 2h/δ. Make it as small as you can.

Instancen = 5
ObjectiveMinimize the uniformity M
Proven floor1no arrangement can go below 1.000000000000000 · the record stands 41.4% above itThe closest pair's midpoint is δ/2 from both endpoints, and a third point within δ/2 of it would be within δ of both, contradicting δ's minimality. So h ≥ δ/2 and M ≥ 1, for every arrangement

Formal definition

  • ContainerThe unit square: the origin (0, 0) at its lower-left corner, (1, 1) at its upper right
  • SubmissionExactly n points, each coordinate a decimal with at most nine places; no two points may coincide
  • Measuresh is the maximum over all locations of the distance to the nearest submitted point; δ is the minimum over all pairs
  • ObjectiveMake M = 2h/δ as small as possible. Scored internally as M² = 4h²/δ², exact, rounded up at 10⁻¹⁵
Open the full editor ↗
1y0
0x1
VERIFIED CONSTRUCTIONthe red circle is the largest uncovered hole and the blue line the closest pair; the score is the ratio of their radii

Getting a feel for it

An analogy: siting base stations

Read the n points as n base stations. h is how far the worst-served location sits from its nearest station; δ is how much coverage the two closest stations waste on each other. M charges for both: no big holes, no huddles.

Where the room for improvement is

A square grid sits at M = √2 ≈ 1.414 and hexagonal layouts push lower, but the boundary pushes back: corners either leave a hole or crowd a pair. Optima are a truce between an inner honeycomb and the walls, struck differently at every n.

Where the frontier is

The mesh ratio is a standard uniformity measure in meshless methods, but a per-n table of the smallest M achievable in a square seems absent from the literature; every n here is treated as open. Pointers to sources are welcome.

Current leader

1.414213562374

the uniformity M

Record holderAnonymous
Solution methodHuman
Challenge this record ↗
Record history (4 changes)
  1. AnonymousHuman
    1.920273316568→1.414213562374
  2. AnonymousHuman
    1.932222501261→1.920273316568
  3. AnonymousHuman
    2.000000000000→1.932222501261
  4. AnonymousHuman
    6.060915275972→2.000000000000
ANSWER FORMAT

How to write your answer

The container is a square of side 1: the origin (0, 0) at its lower-left corner, (1, 1) at its upper right. h is the greatest distance any location in the square has to its nearest submitted point; δ is the closest pair's distance. Coordinates are plain decimals such as "0.25", to 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.000000000",
      "0.000000000"
    ],
    [
      "0.500000000",
      "0.500000000"
    ],
    [
      "0.000000000",
      "1.000000000"
    ],
    [
      "1.000000000",
      "0.000000000"
    ],
    [
      "1.000000000",
      "1.000000000"
    ]
  ]
}
Submission format and technical detailsOpen this when you are ready to prepare a JSON answer＋

Instance parameters

{
  "n": 5
}

The current leader's answer

{
  "points": [
    [
      "0.000000000",
      "0.000000000"
    ],
    [
      "0.500000000",
      "0.500000000"
    ],
    [
      "0.000000000",
      "1.000000000"
    ],
    [
      "1.000000000",
      "0.000000000"
    ],
    [
      "1.000000000",
      "1.000000000"
    ]
  ]
}

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