Yes, without repeating! The Towers of Hanoi game is a clue.
Neevivat ng n (eryngviryl) fvzcyr fbyhgvba vf fvzvyne gb ubj fbyhgvbaf sbe Gbjref bs Unabv ner perngrq, ohg gung'f qbja gur yvar naq rkcynvarq ng gur raq.
I worked out the solution for level 2 on paper, and then eventually I worked out what to do with that to help me with level 3.
