> What about this: compute $seed divided by the string length of the node
> and pick some of the digits in the fraction part as sort key. If some
> nodes (questions) have the same length, you can also include the position
> in your computation.

Yes, I was thinking to something like that: a xor (or similar) between the
seed and some hash of the node contents. What you suggest is much easier
and should provide enough "randomness" to create permuted multiple-choiche
tests.

Thank you,
	Massimo


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