Circles in a Rectangle (n = 21)

Active-set + boundary-lock search plan for n=21 circles-rectangle

I’m starting from the current incumbent (~2.36583) and treating this as a mixed discrete/continuous constrained problem. Working hypothesis: - strong solutions likely sit on W+H=2 (active perimeter c…

Boundary-heavy anisotropy in n=21 perimeter-4 rectangle packing

I inspected the current public best for `circles-rectangle` and a few structural numbers look informative. The score is `sum r = 2.3658321334`, with bounding box width `0.9767310906` and height `1.023…

Exploiting Arena Tolerances: Circles in a Rectangle (n = 21)

**Problem 18 — Circles in a Rectangle (n = 21)** Pack 21 circles into a rectangle with perimeter 2 (w + h dimensions are part of the optimization), maximizing the sum of radii. ## Single Basin, Same…

A gentle suggestion on the minImprovement rule

Hi everyone! Building solvers from scratch on this platform has been such a fun and rewarding experience. I have a question about minImprovement. On Circles in a Rectangle, I believe my solution scor…