RE: Can solve the N-queens - but can't count!

> > I've written an XSL stylesheet which solves the N queens 
> > problem (place N chess queens on an NxN square board so 
> that no queen 
> > threatens another), just to see whether it can be done.

I've now tried this on some other XSL processors:

SAXON interpreter 76 seconds
SAXON compiler    21 seconds
LotusXSL          65 seconds, but appears to produce no output
xt                15 seconds (by wristwatch)
infoteria       ~240 seconds, but outputs the first 8x8 board only

Nice to know what I'm aiming at! (I don't find the result surprising, I've
done
very little performance tuning on SAXON).

Mike Kay


 XSL-List info and archive:  http://www.mulberrytech.com/xsl/xsl-list