In the standard Towers of Hanoi problem, you have three poles: the first has a pyramid of
n disks, and the other two are empty. Your task is to move the disks to the third pole, with the restriction that you can move one disk at a time, never putting a larger disk on top of a smaller one.
How many moves would this task take, if ALL moves had to be either to or from the middle pole? (Thus, you cannot move a disk directly from the first pole to the third one, or viceversa.)
(In reply to
re(2): Solution - R.T.Q. by Leming)
Leming,
Your solution is a better solution.
3n-1
is easier to calculate than
2*Sigma[x=0 to n] 3x-1 : n > 0
|
|
Posted by Dej Mar
on 2006-04-23 21:27:46 |
re(3): Solution - R.T.Q.
