Square Packing(正方形の梱包) Previous best (これまでのベスト) s<3.877084 (Gensane, 2004) New record (新記録) s<3.40 I've significantly improved on the solution to the n=11 square packing problem by using a hydraulic press. (n=11の正方形パッキング問題の解法を、油圧プレスを使って大幅に改善した。) Alt-text: I also managed to improve the solution for n=1 to s<0.97, and with some upgrades I think I can hit 0.96. (また、n=1の解をs<0.97に改善することができ、いくつかのアップグレード