P66 · Packing and covering · Classic · Hard

Unit circles in a minimum-area triangle · n = 6

Also known ascircles in arbitrary trianglesunit circles in a minimum-area trianglecircle packing in a triangle of variable shape

Place n radius-1 circles with disjoint interiors inside an arbitrary triangle. The triangle's three vertices are part of the answer. Minimize its area.

Instancen = 6
ObjectiveMinimize the triangle area
Best known, unproven12 + 7√3the best a certificate can hold 24.124355666451007344Friedman's current table says the best known construction for this row is equilateral; the standard triangular-lattice construction is generated and verified exactly on the nine-decimal grid hereSubmissions are decimal, so a record chases the writable value. If you believe you have the exact closed form, send it in. minmaxarena.com@gmail.com

Formal definition

  • ContainerThe container is a non-degenerate triangle whose shape is not fixed in advance; its vertices and all centres lie in the 0-to-200 coordinate frame
  • SubmissionThree triangle vertices in counter-clockwise order and exactly n circle centres
  • CirclesEvery circle has fixed radius 1; circle interiors are pairwise disjoint and tangency is allowed
  • ContainmentEvery circle lies wholly inside the triangle and may be tangent to an edge
  • ObjectiveMake the triangle area as small as possible
Challenge this record
VERIFIED CONSTRUCTION6 circles with radius 1

Getting a feel for it

The container is a variable

Ordinary packing moves the circles; here all three edge directions move too. A tiny edge rotation can release several contacts at once—or destabilize the whole packing.

The hard part is the contact structure

A candidate optimum is usually jammed by circle-circle and circle-edge tangencies. The real search is not uniform spacing but finding the right contact graph among many possibilities.

Starting beyond the trivial cases

Friedman's public table gives the current best-known constructions through n=50. The n=1 and n=2 rows are proved and n=3 is still the elementary equilateral arrangement, so the arena starts at n=4; matching a published construction reaches the frontier, while beating it sets a new record.

Source
The record-holding arrangement for Unit circles in a minimum-area triangle n = 6, 24.124355666451007344
Current leader

24.124355666451007344

the triangle area

Matches the best known
Answer sourceStandard triangular-lattice construction
Solution methodPublished reference construction
Challenge this record
ANSWER FORMAT

How to write your answer

The coordinate unit is the circle radius: every circle has radius 1. Put all vertices and centres in the box 0≤x,y≤200 and list the vertices counter-clockwise.

Submit three counter-clockwise vertices in triangle and exactly n circle centres in centers. Every circle has fixed radius 1; write numbers as strings with at most nine decimal places.

The current leader's answer

{
  "centers": [
    [
      "1.732050808",
      "1.000000000"
    ],
    [
      "3.732050808",
      "1.000000000"
    ],
    [
      "5.732050808",
      "1.000000000"
    ],
    [
      "2.732050808",
      "2.732050808"
    ],
    [
      "4.732050808",
      "2.732050808"
    ],
    [
      "3.732050808",
      "4.464101616"
    ]
  ],
  "triangle": [
    [
      "0.000000000",
      "0.000000000"
    ],
    [
      "7.464101616",
      "0.000000000"
    ],
    [
      "3.732050808",
      "6.464101618"
    ]
  ]
}
Submission format and technical detailsOpen this when you are ready to prepare a JSON answer

Instance parameters

{
  "n": 6
}

The current leader's answer

{
  "centers": [
    [
      "1.732050808",
      "1.000000000"
    ],
    [
      "3.732050808",
      "1.000000000"
    ],
    [
      "5.732050808",
      "1.000000000"
    ],
    [
      "2.732050808",
      "2.732050808"
    ],
    [
      "4.732050808",
      "2.732050808"
    ],
    [
      "3.732050808",
      "4.464101616"
    ]
  ],
  "triangle": [
    [
      "0.000000000",
      "0.000000000"
    ],
    [
      "7.464101616",
      "0.000000000"
    ],
    [
      "3.732050808",
      "6.464101618"
    ]
  ]
}

Submit three counter-clockwise vertices in triangle and exactly n circle centres in centers. Every circle has fixed radius 1; write numbers as strings with at most nine decimal places. · Verifier v1.0.0

DISCUSSION

Discussion

Talk strategy, share methods, ask why you are stuck. 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. The floor is earned: break a record once, anywhere, and it is yours for good. New posts appear after an automated review.

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