Subject: RE: Can solve the N-queens - but can't count! From: Kay Michael <Michael.Kay@xxxxxxx> Date: Tue, 15 Jun 1999 12:56:32 +0100 |
> > 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
Current Thread |
---|
|
<- Previous | Index | Next -> |
---|---|---|
RE: Can solve the N-queens - but ca, Kay Michael | Thread | Re: Can solve the N-queens - but ca, Oren Ben-Kiki |
String manipulation with script, Olof Tornqvist | Date | RE: understanding trees, Kay Michael |
Month |