⚡ Box Packing is Hard - Keegan R

preview_player
Показать описание
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:

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
Рекомендации по теме
Комментарии
Автор

Came here to find a solution to a box related problem. left with nothing but hopelessness

brunotorres
Автор

A few years back, I was designing a flat-pack product. I had to go down this rabbit hole as I had to fit as many parts as possible onto a sheet of 1.2 by 2.4 meter MDF wood for a CNC router to cut.

In CNC, we call this process 'nesting'. For nesting software packages, there's no 'solution', just a computer running billions of operations based on human principles, and then spitting out its best guess. The problem doesn't feel like it deserves to be this complicated, but here we are. :)

brittanyb
Автор

He should have introduced himself as "I am the nerd version of a boxer".

AndreasDelleske
Автор

Bro made me reconsider my life choices

mr.snooze
Автор

This man would become great speaker, in 5 years i guess

roeniss