Year 9 and 10 Discovery Day - Science and Technology
Hand-on Activity (demo):
The objective of the puzzle is to move the entire stack to one of the other rods, obeying the following rules:
- Only one disk may be moved at a time.
- Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack or on an empty rod.
- No disk may be placed on top of a disk that is smaller than it.
- What is the formula calculating the minimum number of moves required to solve a Tower of Hanoi puzzle with n disks?
- How long in years would it take the priests to complete the game (and the world will then end with it) if they worked day and night, made one move per second, never with a mistake?