New cube packing record for n=12 at 2.9315 set with AI search method
CatAstro_Piyush · x · 2026-10-09
Yohei Nakajima reports a new record for the n=12 cube packing problem at s=2.931514578, beating Haowei Lin's previous 2.93277+ mark, with full coordinates and quaternion orientations for all 12 cubes published. A simpler variant solving square packing found s≈3.877 for 11 squares in 3.75% of runs, showing how AI-driven search can tackle classic discrete geometry problems.
More from Research
- Exa launches ATLAS benchmark: even priciest search agents miss ~1/3 of results — yoimnotkesku · 2026-10-09
- PPTBench: a new benchmark testing if coding agents can rebuild visuals into editable slides — jiqizhixin · 2026-10-09
- TIDE attributes diffusion outputs to training images in milliseconds — serrjoa · 2026-10-09
- DeepScholar-Bench at COLM 2026: benchmarking AI-generated research synthesis — mrdrozdov · 2026-10-09
- Frontier AI models beat human experts at earnings predictions for the first time — maithra_raghu · 2026-10-09
- Cell paper reconstructs cell fate map of the mouse embryo — anshulkundaje · 2026-10-09