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 ->  Customizable Word Problem Solvers  -> Misc -> 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      Log On

Ad: Over 600 Algebra Word Problems at edhelper.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) About Me  (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