Complete both problems and submit by Sunday 1/21 at 11:59pm.
1. Describe the step-by-step process that it takes to complete the tower hanoi puzzle if you start with 4 disks. How many moves are required at the minimum? Remember the following rules:
- Only one disk may be moved at a time.
- A larger disk may not be on top of a smaller disk.
Your goal is to transfer all 4 disks from Pole A to Pole C.
HINT! - You may want to draw this out to show the process. It may be challenging to do the following:
Step 1 - Move disk 1 to Pole B
Step 2 - Move disk 2 to Pole C
Step 3 - ...
2. Naomi patiently solved the Tower of Hanoi puzzle in 513 moves. She claimed that this is the minimum number of moves possible for a certain number of disks. Is this possible? If so, how many disks did she use? If not, explain why not.