N Original Faster Non-pure 4 0.035 0.034 0.035 5 0.045 0.036 0.036 6 0.769 0.041 0.038 7 4.833 0.042 0.038 8 0.082 0.049 9 0.072 0.044 10 0.113 0.056 11 3.504 0.051 12 0.096 13 0.071 14 0.577 15 0.467 16 3.864 17 2.289 18 19.630 19 1.324 20 117.227

I'm curious - have you had a chance to look at why the speeds actually improve when going from 8 to 9 for both Faster and Non-pure and from 10-11 for Non-pure, but slows down 30x for Faster? And, what's with 17, 18, and 19 when it's 2.289 -> 19.630 -> 1.324??

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

The idea is a little like C++ templates, except not quite so brain-meltingly complicated. -- TheDamian, Exegesis 6

Please remember that I'm crufty and crochety. All opinions are purely mine and all code is untested, unless otherwise specified.


In reply to Re: Re: The N-queens problem using pure regexes by dragonchild
in thread The N-queens problem using pure regexes by Abigail-II

Title:
Use:  <p> text here (a paragraph) </p>
and:  <code> code here </code>
to format your post; it's "PerlMonks-approved HTML":