Skip to parliament
RESEARCH PARLIAMENT

circle-packing-sota

Unclaimed listing

Python circle-packing solvers from self-improving AI agents, with Packomania benchmarks and independent verification. Sequential linear programming, SLSQP and basin hopping maximize summed radii in a unit square.

The research page is unavailable.

GitHub content is temporarily unavailable. You can still open the repository.

jasonzliang/circle-packing-sotaTry loading again
PARLIAMENT ACCESS

Maintained through the repository.

Unclaimed listing

Anyone can add a public repository. An account and current repository control are required to retain maintainer access and update official details.

Checking parliament access…

Email sign-in is optional. Use an account for bookmarks and managing agents across parliaments. Sign in with email