⚡ Box Packing is Hard - Keegan R
6.4 هزار بار بازدید -
2 سال پیش
-
A seemingly simple talk about
A seemingly simple talk about trying to put boxes in boxes. What could go wrong?
No prizes for guessing, but quite a lot actually. We'll explore what assumptions we can make to simplify this box packing problem, explore algorithms that might (or might not) help, and see if we can find any reasonable guarantee depending on the dimension.
Challenge:
Can you find an equation, or algorithm, for determining the maximum number of boxes that can be packed using the strategy mentioned at 12:34 ? The more efficient your time complexity, the better!
Further Reading:
https://en.wikipedia.org/wiki/Square_...
https://www.combinatorics.org/ojs/ind...
Talk by Keegan R
00:00 - Introduction
01:07 - Motivation
03:37 - How do we even solve this?
07:04 - What about 2D?
09:26 - Oh Dear
13:19 - The Third Dimension
16:15 - Final Attempt
No prizes for guessing, but quite a lot actually. We'll explore what assumptions we can make to simplify this box packing problem, explore algorithms that might (or might not) help, and see if we can find any reasonable guarantee depending on the dimension.
Challenge:
Can you find an equation, or algorithm, for determining the maximum number of boxes that can be packed using the strategy mentioned at 12:34 ? The more efficient your time complexity, the better!
Further Reading:
https://en.wikipedia.org/wiki/Square_...
https://www.combinatorics.org/ojs/ind...
Talk by Keegan R
00:00 - Introduction
01:07 - Motivation
03:37 - How do we even solve this?
07:04 - What about 2D?
09:26 - Oh Dear
13:19 - The Third Dimension
16:15 - Final Attempt
2 سال پیش
در تاریخ 1401/08/05 منتشر شده
است.
6,447
بـار بازدید شده