Concept
Packing 26
A mathematical optimization problem: placing 26 non-overlapping circles within the unit square to maximize the sum of their radii.
Timeline (last 90 days)
Oct 17
On the Packing 26 problem, the TTT-Discover recipe reached a certified radius sum of 2.635983 within 50 steps, exactly the same as the 2.635983 reported by TTT-Discover, with a target of 2.636, where higher is better.
Unverified50%