Title 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. Origin:https://xkcd.com/2740/ https://www.explainxkcd.com/wiki/index.php/2740:_Square_Packing 方形堆积方案 我也试着把 n=1 的解改进为 s<0.97，再升级一下我觉得可以达到 0.96。 http://xkcd.in/comic?lg=cn&id=2740 方形装箱问题是一种几何问题。目标是找到最小的可能适应N个”内方块”的”外方块”，每个内方块都是1个单位宽和… Read more