Beefy Boxes and Bandwidth Generously Provided by pair Networks
Think about Loose Coupling
 
PerlMonks  

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

All,

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:

http://www.superkids.com/aweb/tools/logic/towers

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... ;>)

ki6jux

"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?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others contemplating the Monastery: (8)
As of 2014-12-28 15:28 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    Is guessing a good strategy for surviving in the IT business?





    Results (182 votes), past polls