|Perl: the Markov chain saw|
Re: Random Math Questionby SciDude (Friar)
|on Oct 10, 2005 at 22:04 UTC||Need Help??|
If each of your groups were randomized at exactly the same time (or perhaps with the same seed) then they should be identical.
Shuffling these groups may mix them up a bit, but only provides for a folded set of groups each of which was identical.
In a perfect process, using the same seed and shuffling procedure would result in an exact copy of A-H elements with each set created. I think we can all agree that the outcome of this effort is not random.
The most important reference in this area is Knuth, D. 1981. (1st ed. 1969.) The Art of Computer Programming. Volume 2: Seminumerical Algorithms. Addison-Wesley.
I would also suggest a careful look at the Runs Test for Randomness - which is quite simple to understand and follow. Most test for randomness fall into the "runs" category.
If all else fails, simply relax your last requirement for suitable definition of acceptable and declare success!
The first dog barks... all other dogs bark at the first dog.