perplexus.info :: Algorithms : Three of Hanoi

Three of Hanoi (Posted on 2005-07-01)

When solving the Towers of Hanoi puzzle, it's easy to show that on every other turn you must move the smallest disk... can you do this?

Then again, can you also prove that the smallest disk will move cyclically -- for example, from post 1 to post 2 to post 3 to post 1, and so on?

Finally, using that fact, can you provide an iterative (that is, not recursive) algorithm for solving the puzzle?

See The Solution Submitted by Federico Kereki

Rating: 4.5000 (2 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)

Question

Comment 3 of 3 |

no of steps required is 2^n -1 = nC1 + nC2 +nC3+....+ nCn

does 'C' have any practical significance ?

Posted by Arjun on 2007-09-08 12:24:04

Please log in:

Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info