SOLUTION: The wizard has been imprisoned by a powerful 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
Algebra.Com
Question 658675: The wizard has been imprisoned by a powerful 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 post. He may 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 take in order to move the ten-disk tower?
PLEASE HELP I CANNOT UNDERSTAND HOW TO SOLVE THIS PROBLEM!!!!!
Answer by jim_thompson5910(35256) (Show Source): You can put this solution on YOUR website!
Hint: This is a tower of hanoi problem, take a look here
http://en.wikipedia.org/wiki/Tower_of_Hanoi
RELATED QUESTIONS
The wizard has been imprisoned by a powerfull spell.To escape he must find the quickest... (answered by Earlsdon)
A young wizard knows every third spell that an old wizard knows. However, the
young... (answered by ikleyn)
what is the quickest way to memorize all of the proofs in... (answered by solver91311)
Explai a sequence of steps that can be used to solve any quadratic equation in the... (answered by stanbon)
At a local airport, a light that produces a powerful white-green beam is placed on the... (answered by Alan3354)
1)Suppose the hard disk above has 1024 cylinders, 8 tracks per cylinder, 32 sectors per... (answered by s11042581)
A flying disk has a diameter of 9 inches. What is the circumference of the disk in... (answered by wilft1)
Factorise: (1-d)(x+2) - (1-d)(x+3)
What is the quickest way to do... (answered by stanbon)
the total profit P on the production and sale of x compact disk if given by... (answered by stanbon)