The question posed to the pupils was:
On a 10x10 board, what is the fewest number of moves needed to visit every squared, cubed or series of numbers of your choice? Easy, except you may only move as a Knight moves on a chess board. Is there any pattern in the number of squares to visit and the least number of moves and what routes did you take?