Welcome to the Monastery | |
PerlMonks |
comment on |
( [id://3333]=superdoc: print w/replies, xml ) | Need Help?? |
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."
In reply to Re^2: Recursion: the Towers of Hanoi problem
by pmonk4ever
|
|