Equal discs covering a disc · n = 36
Cover the largest possible disc with n unit-radius discs. Maximise the covered disc radius.
Instancen = 36
ObjectiveMaximize covered disc radius
Record comparison
covered disc radius · Higher is better| Record | Value / interval | Author / holder | Source |
|---|---|---|---|
| External best known | — | — | No reference listed |
| Site record | No player record yet | — | — |
Formal definition
- ContainerThe editor and certificate normalize to the closed unit disc centred at (1,1). This is a coordinate convention only; scores use the literature's unit-piece scale. Boundary contact is allowed.
- SubmissionSubmit {radius, placements:[{x,y,turn},…]}, with decimal strings of at most nine places. x,y are centres; circles require turn=0, polygons use turn=tan(θ/2). Coordinates and turn lie in ±4; 0 < radius ≤ 4.
- ConstraintsThe n distinct centres lie in the target disc. Covering discs may overlap and protrude, but must cover every target point.
- PrecisionInput decimals are exact rationals; regular-polygon vertices are algebraic, not rounded templates. Feasibility has no floating-point tolerance. A finite-decimal certificate is not a continuous optimality proof.
- ObjectiveCovered disc radius R = 1/r, larger is better.
