Inactive Tutor answered • 02/06/14
Tutor
New to Wyzant
This problem is solved here: http://www.cut-the-knot.org/recurrence/hanoi.shtml. No need to duplicate the solution.
Daniel C.
asked • 02/05/14find the formula
For Tower of Hanoi, find the formula for the minimum number of moves for n discs.
Follow
•
2
Add comment
More
Report
1 Expert Answer
Still looking for help? Get the right answer, fast.
Ask a question for free
Get a free answer to a quick problem.
Most questions answered within 4 hours.
OR
Find an Online Tutor Now
Choose an expert and meet online. No packages or subscriptions, pay only for the time you need.
