3D Magic Knight Tours (Awani Kumar)	Discuss about this problem
In a N*N*N cube, place a chess knight and jump from one square to another by numbering them. The goal is to get the maximum of lines/columns/diagonals equal to the magic sum Please send us a simpler description.