GPU overnight run finds square packing 6x better than best known N=17 solution
tak3sh8 · x · 2026-09-10
As a final project for an optimization class, alexxthiery let a GPU run overnight on the classic square packing problem and found an N=17 packing 6 times better than the currently best known solution, along with packings only 0.05% worse — showing brute-force compute can still beat long-standing human records in combinatorial optimization.
More from Research
- Hobbyist's 348M model hits 99.4% on GPT-3 arithmetic tasks, beats 175B giant — nkthebass · 2026-09-10
- OpenAI claimed 10,000 agents cracked 90-year-old Navier-Stokes problem in 88 hours — r0ck3t23 · 2026-09-10
- Puppeteer: Diffusion Model Generates Object-Grounded, Posture-Aware Co-Speech Gestures — Pickford · 2026-09-10
- RESCUE-BENCH: A New Benchmark for Relation-Aware Multi-Party Emotional Support by LLMs — RuihuangLi · 2026-09-10
- CMU Proposes Discovery Certification Protocol: Scores Alone Don't Prove AI Research Agent Discoveries — CarnegieMellonU · 2026-09-10
- 2026 Survey of Agents opens for responses to map the evolving agent ecosystem — AlexGDimakis · 2026-09-10