you are viewing a single comment's thread
view the rest of the comments
[–] 11 points 8 months ago (1 child)

The optimisation objective is to fit n smaller squares (in this case, n=17) into the larger square, whilst minimising the size of the outer square. So that means that in this problem, the dimensions of the outer square isn't a thing that we're choosing the dimensions of, but rather discovering its dimensions (given the objective of "minimise the dimensions of the outer square whilst fitting 17 smaller squares inside it)

  • source
  • parent
  • hideshow 1 child comment
  • [–] 1 point 8 months ago*

    Specifically, the optimal side length of the larger square for any natural number of smaller squares 'n' is the square root of n (assuming the smaller squares are unit squares). The closer your larger side length gets to sqrt(n), the more efficient your packing.

  • source
  • parent