## The quest for longer hangover February 21, 2009

Posted by keithkchan in fun stuffs.
What’s more surprisingly is that some mathematicians have come up with a better strategy. Look at the following orange stacking. It outplays the conventional answer substantially. More remarkably, the mathematicians managed to transform the problem to some random walk problem and derived a maximum hangover bound $6N^{1/3}$. But this is an upper bound and the best strategy they get $0.57 N^{1/3}$. It is not sure how close to the upper bound it can be achieved. But this is a big big achievement, from logarithmically divergent to cubic root.