The Tower of Hanoi is a 'stacking tower' game. According to the story, a group of Buddhist monks believed that by finding the answer to this problem, they would discover the date that the world would end.
According to the rules of the game, to snwer the qusetion, the monks had to move 100 disks form one location to another. The amount of time taken to move the disks is the same amount of time left before the world will end. According to the game story, by finding out how long it will take to move the disks, the monks could discover the date when the world would end.
GETTING STARTED
Record the date and the title 'Towers of Hanoi' on a clean page in your journal (write your name at the top of the page if you are sharing or not using your own journal).
There are two rules about how the disks can be moved:
Using the above rules, what is the smallest number of moves you can make;
Write down the total number of moves you found using your solution and draw a square around it. Share and compare your solution and justification with others in your group.
EXTENDED ACTIVITIES
If there were 100 disks, when would the game story predict that the world would end?
How do you think you can find out how long it will take to move 100 disks?
Share and compare your solution and justification with others in your group.
Can you discover a general formula that would help you find the total number of moves?
IN YOUR JOURNAL - WHEN YOU HAVE FINISHED