Question: How can I calculate the maximum number of rectangles of any given size that can fit inside a larger rectangle of any given size ?

Good day! 

I have been wrestling with what appears to be a simple problem, but with no success and so, I thought I would reach out for support. 

Consider a two-dimensional strip of any given width, x, and depth, y.

I wish to maximize the quantity of strips that can fit inside a larger two-dimensional surface of any given width, X, and depth, Y. Overhanging is not permitted and all smaller strips must lie within the interior of the larger surface. 

I'm looking for a solution method that can calculate the best configuration necessary to fit the maximum number of smaller strips in the interior of the larger rectangle. Can someone suggest a way (if possible) to solve for this?

Thanks for reading.

Please Wait...