The puzzle shown below is called the Tower of Hanoi. The goal is to move the entire stack of disks from the middle rod to one of the outer rods by following very specific rules. The Tower of Hanoi puzzle is a counting problem. Counting problems involve situations where you determine all the possible outcomes. For example, can you determine the minimum number of moves needed to complete the puzzle with a stack of 15 disks without counting every move? This is the type of problem you will investigate in this lesson.



Click here to try a Tower of Hanoi puzzle and see how it is solved.