If one allows to shuffle the 0 column , collisions are possible and one needs to check.
If it stays fixed it's always fine.
> (Very-pseudo) random,
well "randomness" is not self defining, there are plenty of paradoxes in math were people had different concepts of "random". °
For instance if you said you want
that's a pretty hard problem to be done fast.
I suppose many solutions here will produce certain permutations with a bigger probability. So please be explicit what kind of randomness you want.
Cheers Rolf
(addicted to the Perl Programming Language :)
see Wikisyntax for the Monastery
°) classic example is roulette, the likelihood of a red or black number is always the same, even after a row of hundreds of reds. It's the likelihood of the red sequence which is low.
In reply to Re^3: Algorithm RFC: fast (pseudo-)random shuffle with no repetition (requirements?)
by LanX
in thread Algorithm RFC: fast (pseudo-)random shuffle with no repetition
by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |