this solution packs all 240 boxes (99.1% efficiency); Rather than entering as many boxes as possible in each level, in the actual contest I used a somewhat more convoluted strategy that attempted to condition the box heights so that they would also pack nicely vertically across sequential levels, but the 2d-packing solver works just as well for these simpler "unconstrained" cases. Here (http://www.kaggle.com/c/packing-santas-sleigh/forums/t/6934/how-d-you-do-it/38414#post38414) is a more detailed description of the method I used in that contest, and you may find a link to the solution code there (as well as in this solution) in case you are interested.
Remove NaN ?
First non-zero element in each column
Biggest Value in the (Neighbor)Hood
N-Dimensional Array Slice
Alias abs to asb
Access a web hosted copy of the Tiles Contest MAT file
PACMAT 07 - Optimized Ghosts, PAC 2X Ghost Speed, 4 Lives; Interactive Download
PACMAT - Ghosts Random; 3 Lives
PONG 001: Player vs Wall, 4 Lives, Interactive download
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office