Beefy Boxes and Bandwidth Generously Provided by pair Networks DiBona
P is for Practical
 
PerlMonks  

Re: Recursion: the Towers of Hanoi problem

by abitkin (Monk)
on Oct 20, 2004 at 16:52 UTC ( #400916=note: print w/ replies, xml ) Need Help??

Help for this page

Select Code to Download


  1. or download this
    #!/usr/bin/perl -w
    use strict;
    han('A','B','C',$ARGV[0]);
    ...
        print "Move disc $_[3] from $_[0] to $_[2]\n";
        han($_[1],$_[0],$_[2],$_[3]-1);
    }
    

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others imbibing at the Monastery: (5)
As of 2014-04-19 21:26 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    April first is:







    Results (483 votes), past polls