Perl-Sensitive Sunglasses PerlMonks

Re: Hanoi Challenge

by fruiture (Curate)
 on Oct 22, 2004 at 18:13 UTC ( #401613=note: print w/replies, xml ) Need Help??

Well, no idea if this is very efficient, but it seems to solve all situations (the hanoi-driver does not complain) and is based on your code, just generalized.

```#! /usr/bin/perl -w
use strict;

my \$peg_count  = shift;
my \$disk_count = shift;

my @pegs;
{
my \$p = 'A';
push @pegs , \$p++ for 1 .. \$peg_count;
}

solve( [ @pegs ] , reverse 1..\$disk_count);

sub solve {
my (\$pegs, \$first_disk, @rest) = @_;
my \$from = shift @\$pegs;
my \$to   = shift @\$pegs;
my \$hold = shift @\$pegs;

return unless \$first_disk;

solve( [ \$from, \$hold, @\$pegs, \$to ] => @rest );
print "\$first_disk: \$from -> \$to\n";
solve( [ \$hold, \$to, @\$pegs, \$from ] => @rest );
}

Update: Well, it is absolutely NO more efficient than using 3 pegs anyway, but at least it works.

--
http://fruiture.de

Replies are listed 'Best First'.
Re^2: Hanoi Challenge
by tilly (Archbishop) on Oct 22, 2004 at 18:26 UTC
Good try. It works, but gains nothing in efficiency from using all pegs. Try it with 5 pegs and 4 disks. It takes 15 moves to finish - exactly the same as the 3 peg version. Try solving it by hand. You should have no problem finishing in 7 moves.

Can you find a way to have the program to benefit more from using all pegs?

Create A New User
Node Status?
node history
Node Type: note [id://401613]
help
Chatterbox?
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others contemplating the Monastery: (6)
As of 2017-10-22 23:38 GMT
Sections?
Information?
Find Nodes?
Leftovers?
Voting Booth?
My fridge is mostly full of:

Results (275 votes). Check out past polls.

Notices?