MinMax Arena
中/EN
P05 · Packing and covering · Classic · Hard

Tilted equal squares in a circle · n = 17

Also known assquares in circlespacking unit squares in a circle

Place n freely rotatable squares of one common side inside a circle of radius 1, none overlapping, making that side as large as possible.

Instancen = 17
ObjectiveMaximize the smallest side
Best known, unproven0.373570625Source-precision interval: 0.3735692298496757–0.3735706253945840 (values inside match)exhibited site certificate 0.373569949As printed in the source (container radius for unit squares): 2.67687+Milan Kovacic found the r = 2.67687+ packing in May 2026 (radius of the smallest circle around unit squares). The site digitised the squares' positions and orientations from the public figure, solved that fixed separating-axis structure and repaired it inward to a nine-decimal certificate scoring 0.139554506980699732; the truncated source interval is compared separately from the certificate, and optimality is open

Formal definition

  • ContainerA circle of radius 1 centred at (1, 1), so both coordinates run from 0 to 2
  • SubmissionEach square is {cx, cy, ux, uy}: a centre plus one half-edge vector, the other fixed as (−uy, ux)
  • ConstraintsEvery square tilts freely; all lie inside the container; no two overlap in their interiors, touching allowed. Only the smallest square is scored, so unequal sides gain nothing
  • ObjectiveMake the common side as large as possible; compared internally by its square, exactly
Open the full editor ↗
2y0
0x2
VERIFIED CONSTRUCTION17 squares

Getting a feel for it

Where the room for improvement is

A circular container has no corners: straight sides cannot hug the arc, so optima are almost always tilted, squares bracing corner against corner.

Where the frontier is

n = 4 is proven; the other best known values up to n = 35 come from Friedman's squares-in-circles survey (many contributors since 1997), none of them proven; n = 36–40 have no public record at all.

Source
The record-holding arrangement for Tilted equal squares in a circle n = 17, 0.373569949
Current leader

0.373569949

the smallest side

Matches the best known
Answer sourceMilan Kovacic
Solution methodPublished reference construction
Challenge this record ↗Submit a proof / idea ↓Share a proof or idea in the discussion. Accepted contributions can earn proof points.
Record holder's solver noteNo solver note yet (expand)＋

The record holder has not shared a solver note yet.

ANSWER FORMAT

How to write your answer

The container is a circle of radius 1 centred at (1, 1), so coordinates run from 0 to 2. Coordinates and vectors share one unit and are written as plain decimals such as "0.4", to at most nine decimal places.

Submit {cx,cy,ux,uy} per square: a centre plus one half-edge vector, the other half-edge being (-uy,ux). Write every number as a decimal string such as "0.4", every angle is free, and the smallest square is the one scored, so writing them equal is the winning move. The side is almost always irrational, so what you write is the half-edge vector and the side follows from it exactly.

The current leader's answer

{
  "squares": [
    {
      "cx": "1.226958937",
      "cy": "0.270468569",
      "ux": "0.186504578",
      "uy": "0.010230797"
    },
    {
      "cx": "0.957503999",
      "cy": "1.779972864",
      "ux": "0.186600182",
      "uy": "-0.008306553"
    },
    {
      "cx": "0.616803397",
      "cy": "0.853425531",
      "ux": "0.186600182",
      "uy": "-0.008306561"
    },
    {
      "cx": "1.034382299",
      "cy": "1.385735795",
      "ux": "0.186728624",
      "uy": "0.004587808"
    },
    {
      "cx": "1.590830298",
      "cy": "0.559046560",
      "ux": "0.186728625",
      "uy": "0.004587763"
    },
    {
      "cx": "0.836620534",
      "cy": "0.244681856",
      "ux": "0.186600183",
      "uy": "-0.008306548"
    },
    {
      "cx": "1.683876164",
      "cy": "1.308698067",
      "ux": "0.186728625",
      "uy": "0.004587758"
    },
    {
      "cx": "1.029057434",
      "cy": "1.011922241",
      "ux": "0.186728624",
      "uy": "0.004587810"
    },
    {
      "cx": "0.993580001",
      "cy": "0.637367857",
      "ux": "0.186728624",
      "uy": "0.004587809"
    },
    {
      "cx": "1.778255497",
      "cy": "0.937334163",
      "ux": "0.186728625",
      "uy": "0.004587760"
    },
    {
      "cx": "1.404798201",
      "cy": "0.928158636",
      "ux": "0.186728625",
      "uy": "0.004587767"
    },
    {
      "cx": "0.243603013",
      "cy": "0.870038641",
      "ux": "0.186600182",
      "uy": "-0.008306560"
    },
    {
      "cx": "0.575692109",
      "cy": "1.603135466",
      "ux": "0.186600183",
      "uy": "-0.008306552"
    },
    {
      "cx": "0.473417074",
      "cy": "0.485868460",
      "ux": "0.186600183",
      "uy": "-0.008306547"
    },
    {
      "cx": "1.392003827",
      "cy": "1.692342065",
      "ux": "0.092029877",
      "uy": "0.162539622"
    },
    {
      "cx": "0.278982995",
      "cy": "1.242403614",
      "ux": "0.186600182",
      "uy": "-0.008306560"
    },
    {
      "cx": "0.652183367",
      "cy": "1.225790490",
      "ux": "0.186600182",
      "uy": "-0.008306561"
    }
  ]
}
Submission format and technical detailsOpen this when you are ready to prepare a JSON answer＋

Instance parameters

{
  "n": 17
}

The current leader's answer

{
  "squares": [
    {
      "cx": "1.226958937",
      "cy": "0.270468569",
      "ux": "0.186504578",
      "uy": "0.010230797"
    },
    {
      "cx": "0.957503999",
      "cy": "1.779972864",
      "ux": "0.186600182",
      "uy": "-0.008306553"
    },
    {
      "cx": "0.616803397",
      "cy": "0.853425531",
      "ux": "0.186600182",
      "uy": "-0.008306561"
    },
    {
      "cx": "1.034382299",
      "cy": "1.385735795",
      "ux": "0.186728624",
      "uy": "0.004587808"
    },
    {
      "cx": "1.590830298",
      "cy": "0.559046560",
      "ux": "0.186728625",
      "uy": "0.004587763"
    },
    {
      "cx": "0.836620534",
      "cy": "0.244681856",
      "ux": "0.186600183",
      "uy": "-0.008306548"
    },
    {
      "cx": "1.683876164",
      "cy": "1.308698067",
      "ux": "0.186728625",
      "uy": "0.004587758"
    },
    {
      "cx": "1.029057434",
      "cy": "1.011922241",
      "ux": "0.186728624",
      "uy": "0.004587810"
    },
    {
      "cx": "0.993580001",
      "cy": "0.637367857",
      "ux": "0.186728624",
      "uy": "0.004587809"
    },
    {
      "cx": "1.778255497",
      "cy": "0.937334163",
      "ux": "0.186728625",
      "uy": "0.004587760"
    },
    {
      "cx": "1.404798201",
      "cy": "0.928158636",
      "ux": "0.186728625",
      "uy": "0.004587767"
    },
    {
      "cx": "0.243603013",
      "cy": "0.870038641",
      "ux": "0.186600182",
      "uy": "-0.008306560"
    },
    {
      "cx": "0.575692109",
      "cy": "1.603135466",
      "ux": "0.186600183",
      "uy": "-0.008306552"
    },
    {
      "cx": "0.473417074",
      "cy": "0.485868460",
      "ux": "0.186600183",
      "uy": "-0.008306547"
    },
    {
      "cx": "1.392003827",
      "cy": "1.692342065",
      "ux": "0.092029877",
      "uy": "0.162539622"
    },
    {
      "cx": "0.278982995",
      "cy": "1.242403614",
      "ux": "0.186600182",
      "uy": "-0.008306560"
    },
    {
      "cx": "0.652183367",
      "cy": "1.225790490",
      "ux": "0.186600182",
      "uy": "-0.008306561"
    }
  ]
}

Submit {cx,cy,ux,uy} per square: a centre plus one half-edge vector, the other half-edge being (-uy,ux). Write every number as a decimal string such as "0.4", every angle is free, and the smallest square is the one scored, so writing them equal is the winning move. The side is almost always irrational, so what you write is the half-edge vector and the side follows from it exactly. · Verifier v1.0.0

DISCUSSION

Discussion

Talk strategy, share methods, ask why you are stuck. Every signed-in user can post. Posts carry your public byline, the same name your records use; the #number after it is the account's signup ordinal, so a name cannot be worn by someone else. New posts appear after an automated review.

No threads yet. Be the first to talk about this problem?