About list randomization, fairness, and reproducibility
List randomization takes an ordered list of names, entries, rows, tasks, or numbers and produces a new random order. This tool uses the well-known Fisher-Yates shuffle, which walks the list from end to start and swaps each item with a uniformly chosen earlier item or itself. With a uniform random number generator, Fisher-Yates gives every possible ordering the same chance.
Picking winners uses the same shuffled order and returns the first N items, which is equivalent to drawing winners without replacement. If duplicates stay in the input, repeated names count as extra entries. If duplicates are removed, each unique item gets one chance.
Seeded results let you repeat the same shuffle later. Use the same input list, duplicate setting, winner count, and numeric seed to reproduce the order and share the verification details after a public draw.
