Given the nets of 4 cubes with the faces coloured in 4 colours, build a tower so that on each vertical wall no colour is repeated, that is all 4 colours appear.
Draw a square. A second square of the same size slides around the first always maintaining contact and keeping the same orientation. How far does the dot travel?
What would be the smallest number of moves needed to move a Knight from a chess set from one corner to the opposite corner of a 99 by 99 square board?
This is quite a difficult problem to imagine in your head. If you've tried very hard without success, then actually dangle a cube into some water.