Consider a 3 by 3 by 3 cube — in essence, a Rubix cube — like the one pictured in the following image:
Start from the cube in the middle, enclosed on all sides. Moving to only cubes that are directly adjacent, is it possible to visit all small cubes exactly once?
No
The reason is to do with parity:
Color the little cubes in an alternating pattern, black and white. Suppose the corners are white. Then there are 14 white and 13 black cubes. You always go from a white to a black and from a black to a white. But the center cube is black. So if you start from black, you'll have covered either one more black than white or the same number of each at every step. You'll never get to one more white than black.
Here's an interesting video: 3x3x3 snake cube puzzle. Note how this cube has green corners and when it is stretched out it has green on either end. This is inevitable for the same reason.
I think the answer is
No
because,
the cubes can be represented as nodes on a graph, connected by edges to adjacent cubes. Each of the corner cubes is adjacent to 3 others, and for a graph to be traversible there must be 0 or 2 nodes with odd degree (that is, an odd number of edges to other nodes).
