Protein folding (Guenter Stertenbrink)Discuss about this problem
given an integer n and a binary sequence
a:{1..n^3}-->{0,1} pack the sequence into {1..n}^3
p:{1..n^3}-->{1..n^3} bijective
such that p(i) and p(i+1) have distance 1 and such that
|{(i,j) , p(i) and p(j) have distance 1 and a(i)=1=a(j)}| is maximum for a version in 2dimensions see:
Fold a snake composed of black and white cubes into the smallest possible rectangular box. You get one point for every adjacent pair of cubes of the same color.