Students used their problem solving skills in order to solve the famous mathematical puzzle, The Tower of Hanoi. In this problem there are three pegs, and on the first peg is a stack of discs of different sizes, arranged in order of descending size. The object of the game is to move all of the discs to another peg. However, only one disc can be moved at a time, and a disc cannot be placed on top of a smaller disc. When repeating this with 1,2,3, 4 and 5 discs a pattern emerges. The next challenge was to find the pattern and predict how many moves would be needed if their were 15 discs.