How to put a list in random order

Picking one winner is easy. Shuffling everyone into a fair order is a different job — here's how to do it properly.

Sometimes you don't want a single winner. You want the whole list, just shuffled: who presents first, second and third; the running order for a line-up of performers; the sequence interview candidates are seen in; the order fixtures get played. That's a different task from drawing one name, and treating it like a one-off pick is where people quietly introduce bias.

This guide explains what a random order actually is, why ad-hoc shuffling tends not to be fair, and a simple, repeatable way to turn an everyday picker into a full random-order generator.

Picking one winner vs. ordering everyone

Drawing one winner answers a single question: who? A random order answers a much bigger one: who, then who, then who — all the way down. In maths terms you're producing a permutation of the list: a complete arrangement where every entry appears exactly once, in some shuffled sequence.

The number of possible orders climbs fast. Three names have six possible orders; ten names have over three million. A fair shuffle has to treat every one of those arrangements as equally likely — not just give first place to a random name and then leave the rest more or less as they were.

Where a random order earns its keep

Once you start looking, the uses are everywhere:

• Turn order in a board game, a card game or a tournament bracket, so nobody argues about who goes first.
• Presentation running order for a team stand-up, a pitch session or a class of speakers.
• Performance line-ups — bands at an open mic, acts in a talent show, readers at an event.
• Interview and audition slots, randomised so the sequence candidates are seen in isn't decided by who applied first.
• Fixture order in a small league or a knockout draw.
• Shuffled playlists, where you genuinely want the tracks rearranged rather than always starting with the same song.
• Seating, for a workshop, a dinner or a classroom where you'd rather not let cliques choose for themselves.

What a fair shuffle actually means

A shuffle is fair when every possible order is equally likely. That's the whole definition. If some arrangements can never come up, or come up far more often than others, the shuffle is biased — even if it looks random at a glance.

The common mistake is the "just swap a few" method: write the list down, then swap a couple of pairs that catch your eye until it "feels mixed". The trouble is that you tend to leave most entries close to where they started, and the swaps you choose aren't random at all — they're driven by which names you happened to notice. Names near the top often stay near the top. A proper shuffle doesn't favour any starting position; it scatters the whole list with no memory of where anything began.

Build a random order by drawing and removing

Here's the neat part: you don't need a separate shuffling tool. Any fair picker that lets you remove an entry after it's drawn already is a random-order generator. The trick is to repeat the draw.

Draw a name — that's position one. Remove it from the pool. Draw again from what's left — that's position two. Remove it, and keep going. Each draw fills the next slot in the order, and because the pool shrinks every time, no name can land twice. When the list is empty, you've built a complete random order, one position at a time.

A step-by-step routine with the wheel

You can run the whole thing on SpinKit's spin wheel with remove-on-draw switched on:

1. Load every entry. Paste or type the full list into the wheel and check it with the group before you start.
2. Turn on remove-on-draw so each result drops out of the wheel after it lands.
3. Spin for first place. Whatever lands is position one — write it down.
4. Spin again for position two, then three, and so on. The wheel automatically narrows to the names still waiting.
5. Stop when the wheel is empty. Your written-down sequence is now a fair, complete random order.

If you'd rather not spin once per slot, the team picker shuffles a list as part of splitting it into groups — so even when you only want one team, it gives you the list in a randomised order to read off.

Order bias — the hidden thumb on the scale

Why bother shuffling at all? Because position itself can matter. In judging, voting, tasting panels and auditions, going first or last is rarely neutral: the first entry sets the bar everyone else is measured against, and the last one is freshest in mind when scores are given. People don't do this on purpose — it's just how attention and memory work.

If the order is decided by something other than chance — alphabetical surnames, sign-up time, whoever shouted first — then that advantage or disadvantage lands on the same people every time. Randomising the order doesn't remove the effect of going first, but it makes sure nobody is handed that position systematically. Over a season of fixtures or a stack of interviews, that's the difference between a fair process and a quietly skewed one.

Ties, late additions and re-rolls

A few practical points come up often:

• Ties don't really exist here. Because each draw removes the winner, you can never land two entries in the same position — the method breaks ties for you by construction.
• Late additions. If someone turns up after you've started, the fairest move is to add them and re-draw the whole order. Slotting a latecomer into a position you've chosen by hand reintroduces exactly the bias you were avoiding.
• Re-rolling. It's fine to re-spin if you genuinely made a mistake — a name was misspelt, or someone was missing. It is not fine to keep re-rolling until you get an order you like. Decide your rule before you start, and stick to the first valid result.

Settle those questions up front and the draw stays clean: one shuffle, agreed in advance, that everyone watched happen.