Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw

Re^2: Recursion: the Towers of Hanoi problem

by pmonk4ever (Friar)
on Dec 03, 2008 at 00:16 UTC ( #727527=note: print w/replies, xml ) Need Help??

in reply to Re: Recursion: the Towers of Hanoi problem
in thread Recursion: The Towers of Hanoi problem


This runs on ActiveState Perl 5.10.0 as it is written, which is really a nice implementation for visualization of the problem space... :)

I tinkered with it a little, added a variable to count the number of moves. 10 disks were my limit, that solves fairly quickly. Never did get to the 21 disc version, I didn't want to wait that long. :)

However, one of the links published by dragonchild led me to this site:

where I found a short history of the tale, seems there are 64! discs, so the final solution works out to ~585 billion years or so, moving one disc a second...too much time for me to spend...but it was a very interesting exercise... ;>)


"No trees were harmed in the creation of this node. However, a rather large number of electrons were somewhat inconvenienced."

  • Comment on Re^2: Recursion: the Towers of Hanoi problem

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://727527]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others rifling through the Monastery: (5)
As of 2016-10-23 00:32 GMT
Find Nodes?
    Voting Booth?
    How many different varieties (color, size, etc) of socks do you have in your sock drawer?

    Results (299 votes). Check out past polls.