luajit version of the n-queens solver

should be the same algorithm as the other scripts. I had to unroll it a little to enable tail recursion (pass the results as parameters etc). Playing with this script reveals a bunch of odd things about luajit, at least, my luajit on my particular machine. When I run cpython on the python version at size=10 it gives me about 0.78 seconds, which is quite different from your machine which does it 5 times faster.