http://qs321.pair.com?node_id=400359

Hi all.

Many computer science professors eventually discuss the concept of recursion. To help illustrate the power and elegance (yes, there are drawbacks as well) it provides, a classic problem known as the 'Towers of Hanoi' is often used. For those unfamiliar with this classic, please allow me explain the history and rules...

### The History:

The puzzle is called "Towers of Hanoi" because an early popular presentation wove a fanciful legend around it. According to this myth (uttered long before the Vietnam War), there is a Buddhist monastery at Hanoi which contains a large room with three time-worn posts in it surrounded by 21 golden discs. Monks, acting out the command of an ancient prophecy, have been moving these disks, in accordance with the rules of the puzzle, once every day since the monastery was founded over a thousand years ago. They are said to believe that when the last move of the puzzle is completed, the world will end in a clap of thunder. Fortunately, they are nowhere even close to being done.

### The Rules:

• There are n disks (1, 2, 3,..., n) and three towers (pegs). The towers are labeled 'A', 'B', and 'C'.
• All the disks are initially placed on the first peg (the 'A' peg).
• No disk may be placed on top of a smaller disk.
• You may only move one disk at a time and this disk must be the top disk on a peg.

### The Code:

```use warnings;
use strict;

# Towers of Hanoi
# Perl version (5.8.0)
# Ported from Java

my \$numdisks = 0;

print "Number of disks? ";
chomp( \$numdisks = <STDIN> );

print "The moves are:\n\n";
movedisks( \$numdisks, 'A', 'B', 'C' );

sub movedisks {

my( \$num, \$from, \$to, \$aux ) = @_;

if( \$num == 1 ) {
print "Move disk \$num from \$from to \$to\n";
}

else {
movedisks( \$num-1, \$from, \$aux, \$to );
print "Move disk \$num from \$from to \$to\n";
movedisks( \$num-1, \$aux, \$to, \$from );
}
}