Optimal placement in a two-density square · n = 10
Place n points in a unit square to minimize the total squared distance to the nearest point. Errors in the left half count four times as much.
Record comparison
weighted squared-distance integral · Lower is better| Record | Value / interval | Author / holder | Source |
|---|---|---|---|
| External best known | — | — | No reference listed |
| Site record | 0.036817241158065 | 今天 | Record details ↓ |
Formal definition
- ContainerThe square runs from (0, 0) to (1, 1). The line x = 1/2 separates the two halves with weights 4 and 1.
- SubmissionChoose exactly n distinct points in the closed square, with at most nine decimal places per coordinate.
- ScoreThe density is 4 on the left and 1 on the right. The integral is computed exactly and rounded up to a multiple of 10⁻¹⁸. Smaller is better. The dividing line has zero area.
- ObjectivePlace the points to minimize the weighted integral.