BALKAN 2001 Problem 4
- Paper
A cube side 3 is divided into 27 unit cubes. The unit cubes are arbitrarily labeled 1 to 27 (each cube is given a different number). A move consists of swapping the cube labeled 27 with one of its 6 neighbours. Is it possible to find a finite sequence of moves at the end of which cube 27 is in its original position, but cube has moved to the position originally occupied by (for each )?
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.