SOLUTION: The wizard has been imprisoned by a powerfull spell.To escape he must find the quickest way to move the tower of ten disks from one post to another such that the disks have the sam

Click here to see ALL problems on Linear Equations And Systems Word Problems

Question 213138: The wizard has been imprisoned by a powerfull spell.To escape he must find the quickest way to move the tower of ten disks from one post to another such that the disks have the same arrangement as on the original post. he must MOVE ONLY ONE DISK AT A TIME, and he may NEVER PLACE A LARGER DISK ON TOP OF A SMALLER ONE.What is the minimum number of moves he must make in order to move the ten-disk tower?
Hint:use 3 posts
Answer by Earlsdon(6294) (Show Source):
You can put this solution on YOUR website!
This is a variation of "The Tower of Hanoi" problem in which there are 64 disks and three posts to be moved under the same rules.
If you were to try something like this yourself but using only three disks, you would find that it take a minimum of 7 moves.
It turns out that the minimum number of moves (M) can be expressed as:
where n is the number of disks.
So for three disks, you would get:

For 10 disks, n=10 so...