Eating a cake from the inside. Imagine that you are in the centre of a cube of cake with a known size. In order to move you must eat the surrounding cake but you can only move within the restraints of the six obvious directions $(x+1,x-1,y+1,y-1,z+1,z-1)$.
The puzzle is- can you eat the entire cake in such a fashion without overlapping parts of the cake which you have already eaten.
I would actually like to answer this question for a practical purpose and I have put much thought into it. From what I understand it may only be possible by moving diagonally (applying $2$ or more movements of different axis at the same time-such as $x-1$ and $y-1$).
I have asked my maths teacher and some of my friends but I am sure there must be a solution.
 A: If you are exactly in the middle and can only go in the 6 directions, it is like being in a cube with an odd number of sides (in order to have an exact middle cube).  If you colored the cubes alternately black and white with the middle one white, then you are in the white cube and there are one more black cubes than there are white cubes (counting the middle cube.) (This would be for a 3 x 3 x 3 or a 7 x 7 x 7 cube.) This is because an odd sided cube has n x n x n cubes which is an odd number of cubes, so there has to be more blacks than whites by 1 (or visa-versa in 5 x 5 x 5 or 9 x 9 x 9 cubes etc.) So, if you eat the white one first (the one you are in) then eat alternately black and then white cubes, you end up having to eat a white cube then there are two black cubes left and you eat one of them and then you cannot eat a white cube!
So, it is impossible as far as I can see.
I need to edit my answer. If the number of units on each side is 5+4k (where k=0,1,2,...) then I think it can be done because the greater number of white squares will end up with a white one in the middle. But I think 3+4k units on each side cannot be done because of the situation I was describing. On 3+4k sided cubes the middle square is a different color than the corner squares. This one cannot be done. (If you are in the middle square and it is white and you eat it, there will be two more black squares than white.) Whereas on 5+4k sided cubes, the middle square is the same color as the corner squares and after you eat the middle square there will be the same number of squares of each color.
So, it can always be done if you break the cube into the proper number of odd units on each side. I think this is the correct answer, but there may be more complications than what I have been discussing. The 3+4k sided cubes definitely cannot be done.
A: 
Preamble: comparison with MathBob's approach. I realized after
  entering this that the sets $E,O$ used below can also be described as
  the set of triples $(x,y,z)$ for which $x+y+z$ is even or odd,
  respectively. So if the middle cube is white, this is the same
  coloring used by MathBob, where the count of whites is the count of
  $E$, the black count of $O$, What I found hard to see was how the
  value of $n$ mod $4$ entered into why there are one more of which
  color. So what I did was to actually count these numbers, and it came
  out that in the $n=4k+3$ case there is one more black (odd) than
  white. I don't know if there is a simple way to see that short of
  actually counting the two numbers as I did below. I left the rest as
  it was, using taxicab distance language.

This answer is to show the impossibility in case $n=4k+3,\ k\ge 0$ [The procedure for eating the cake if $n=4k+1$ has already been shown by achille hui and mentioned by MathBob.]
The idea is to partition the cubes into two sets $E,O$ of those points whose taxicab distance from the origin is even or odd respectively. It can be shown (see below) that for $n=4k+3$ we have
$$|E|=32k^3+72k^2+54k+13,\\ |O|=32k^3+72k^2+54k+14. $$
Every legal move is from a point in $E$ to one in $O$, or vice-versa. The center of the cube is in $E$, and since we are to start there, the tour cannot be made since there is one more element in $O$ than there is in $E$.
proof of counts for $|E|,|O|.$ In the set $\{-2k-1,\cdots,2k+1\}$ of values available for a coordinate of a point $(x,y,z)$ in the $n$-cube (with $n=4k+3$) there are $2k+1$ even integers and $2k+2$ odd integers. If $(x,y,z)$ is at even taxicab distance from $(0,0,0)$ then either all three coordinates are even or else two are odd and the third even. Since there are three ways the odd,odd,even case can occur, the count for $|E|$ is
$$|E|=(2k+1)^3+3(2k+1)(2k+2)^2,$$
which when expanded is our claimed count for $|E|.$ On the other hand if $(x,y,z)$ is at odd taxicab distance from the origin, then either all three coordinates are odd or else (three ways for this) one is odd and two are even. This gives the $|O|$ count as
$$|O|=(2k+2)^3+3(2k+2)(2k+1)^2,$$
which expands to our claimed count for $|O|$. As a check one finds that $|E|+|O|=(4n+3)^3.$ 
Final note: If one does the above calculation for the (shown to be possible) case when $n=4k+1,\ k \ge 1$, it turns out that $|E|=|O|+1$, which means starting inside $E$ (center of cube) this parity argument does not rule out a path. (That's a good thing, given the constructions of actual solutions in the $4k+1$ case.)
