'Find the hidden sequence in this game that makes it such a great puzzle' 

The Tower of Hanoi game is a great puzzle that everyone can have a go at! How can we move three different sized discs from one side to the other, without ever putting a bigger disc on top of a smaller one and in as few moves as possible? How do we know we have used as few moves as possible? What if there were four discs to start with? What about five or six? Can we predict how many moves it would take to move ten discs? If we knew how to do it, what is the biggest number of discs we could move from one side to the other in our lifetimes? This activity is about the search for answers to these questions. In doing so, the aim is to collect data, look for patterns, make conjectures, test them and go on to make a generalisation about how the number of moves needed is related to the number of discs!

Watch this student solve the puzzle with 3 discs. Pay attention to when they hesitate!