Re: Efficient N-Queen solution with Perl

Just for the record, I cut the overhead of calling subroutines and in fact, minimized blocks ( like, if{} for{}, etc ) and gained a 30% increase in speed.

I believe what prompted me to do this was somebody's posting on perlmonks, but I forget who at this point...

In any case, perl still remains about 100 times slower than Java. ugh.

Comment on Re: Efficient N-Queen solution with Perl

Replies are listed 'Best First'.
Re: Re: Efficient N-Queen solution with Perl by dragonchild (Archbishop) on Nov 20, 2001 at 01:52 UTC
Here's a thought: Post your proposed solution and let us have a try at it. I'm positive that there's a number of optimizations you haven't seen, cause you're the original author. (This applies to everyone, including tilly, tye, and merlyn.) (Only Erudil doesn't need this kind of help ... he needs a completely different form of help. grins) ------ We are the carpenters and bricklayers of the Information Age. Don't go borrowing trouble. For programmers, this means Worry only about what you need to implement.	[reply]

Replies are listed 'Best First'.

Re: Re: Efficient N-Queen solution with Perl
by dragonchild (Archbishop) on Nov 20, 2001 at 01:52 UTC

Post your proposed solution and let us have a try at it. I'm positive that there's a number of optimizations you haven't seen, cause you're the original author. (This applies to everyone, including tilly, tye, and merlyn.)

(Only Erudil doesn't need this kind of help ... he needs a completely different form of help. *grins*)

------
We are the carpenters and bricklayers of the Information Age.

Don't go borrowing trouble. For programmers, this means Worry only about what you need to implement.

[reply]