just a guess: try multiplying each ord with a different prime (by position) and do a module biggest prime <256 before adding.
or start a new thread about efficient checksums! :)
UPDATE: the automatic seeding is quite efficient, so why don't you determine a unique seed at installation time from a random number.
Cheers Rolf
In reply to Re^6: How do I make a random shuffle deterministic?
by LanX
in thread How do I make a random shuffle deterministic?
by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |