I was doing one Euler project problem, but stuck...

#! /usr/bin/perl -w

use strict;
my ($A, $B, $P, $Max, $i );

my $High = 9999;   # Highest number
my $Low  = 1000;   # Lowest  number
my $Digits = 8;    # Number of digits required.


$Max = 0;

for ($A = $High ; $A >= $Low ; $A--)
{
	for ($B = $High ; $B >= $Low ; $B--)
	{
		$P = $A*$B;
                # Don't need to check for palindrome, if this is smaller than the Max.
		next if ($P <= $Max) ;
                # Don't need to check not the correct number of digits.
		next if (length($P) != $Digits) ;

                # Check for palindrome
                for ($i = 0; $i <= ($Digits/2) ; $i++ ) { 
		   last if ( substr($P, $i, 1) ne substr($P, (length($P)-($i+1)), 1) );
		   if ($i == ($Digits/2)) {
		        $Max = $P;
		        print $A, " x " , $B, " = ", $P, "\n";
		   }
		}
		
		
	}
}

print "The largest palindrome is " , $Max , "\n";

exit(0);

#! /usr/bin/perl -w

use strict;
my ($A, $B, $P, $Max, $i );

my $High = 6000;   # Highest number
my $Low  = 1000;   # Lowest  number
my $Digits = 8;    # Number of digits required.

$Max = 0;

for ($A = $High ; $A >= $Low ; $A--)
{
	for ($B = $High ; $B >= $Low ; $B--)
	{
		$P = $A*$B;

                # Don't need to check for palindrome, if this is smaller than the Max.
#		next if ($P <= $Max) ;
                # Don't need to check for palindrome, if this is not the correct number of digits.
		next if (length($P) != $Digits) ;

                # Check for palindrome
                for ($i = 0; $i <= int($Digits/2) ; $i++ ) { 
		   last if ( substr($P, $i, 1) ne substr($P, (length($P)-($i+1)), 1) );
		   # if this is true,  then it is a palindrome
		   if ($i == int($Digits/2)) {
		        if ($Max < $P) { $Max = $P; }
		        print $A, " x " , $B, " = ", $P, "\n";
		   }
		}
		
		
	}
}

print "The largest palindrome is " , $Max , "\n";

exit(0);

use strict;

print "The goal is to find the largest palindrome made from the product of two numbers.\n
Enter the number of digits for the two numbers. \n";

print "First number:\n";
my $dig1 = <>;
chomp($dig1);
print "Second number:\n";
my $dig2 = <>;
chomp($dig2);

my $dig = $dig1 + $dig2;
my $max1 = 10**$dig1;
my $max2 = 10**$dig2;
my $min1 = 10**($dig1-1);
my $min2 = 10**($dig2-1);

my ($A, $B, $P, @digits, $Largest, $Rev, @reverse);

for ($A = $max1 ; $A >= $min1 ; $A--)
{
	for ($B = $max2 ; $B >= $min2 ; $B--)
	{
		$P = $A*$B;
		if ( $P < $Largest || length($P) != $dig) {next;}

		@digits = split(//, $P);
		@reverse = reverse(@digits);
		$Rev = join("",@reverse);
		if ( $P == $Rev) { $Largest = $P; }
	}
}

print "The largest palindrome is " , $Largest , "\n";