Skip to content
EN

Published: 2026-07-15

Shuffle once, then reveal one at a time

There are two ways to draw names from a list, and they look almost identical until the second draw. You can press a picker again and get a fresh independent result — which means it can hand you the same name twice in a row. Or you can shuffle the whole list once, up front, and then walk down it one name at a time. The second approach is a different guarantee, and for anything with turns in it, it's usually the one you actually wanted.

Re-rolling isn't the same as taking turns

A single picker answers one question: who, right now? Ask it again and it answers the same question from scratch, with the full list in play. That's correct behaviour — every draw is independent and everyone has equal odds every time — but independence is exactly what you don't want when you're assigning turns. Press it twelve times for a twelve-person standup and you'll get repeats, misses, and someone quietly wondering why they went twice while a colleague never came up at all.

A shuffled queue makes the opposite promise. The list is randomized once, and then it's consumed: each reveal takes the next name off the top and it's gone. Twelve people means twelve reveals, everyone exactly once, in an order nobody chose. That's a draw without replacement, and it's what people usually mean when they say "randomize the order" — they're not asking for twelve independent lotteries, they're asking for one permutation.

The reveal is the point

You could get the same fairness from any tool that spits out a shuffled list in one go. What the one-at-a-time reveal adds is pacing. A full ordered list posted on a screen means everyone reads to the bottom, finds their name, and mentally checks out until their slot approaches. Revealing one name at a time keeps the room in the present: nobody knows who's after them, so nobody's rehearsing instead of listening.

The Sequential Random Picker is built exactly around that split. Paste your list, hit Shuffle queue once to lock in the order, and then hit Next ▶ whenever you're ready for the following name. The counter under the result tells you how many are left, each reveal is logged in the history below, and when the queue runs out it says so rather than looping around and starting again by surprise.

The queue outlives the tab

Here's the part that isn't obvious from looking at it: the shuffled queue and your position in it are saved to your browser's local storage, not just held in memory. Close the tab, reload the page, come back after lunch — the queue is still there, still in the same order, still pointing at the same next name. Nothing is uploaded anywhere; it just lives in that browser on that device.

That turns the tool into something you can run across a whole session rather than a single sitting. Shuffle a class list on Monday morning and reveal one name each time you need a volunteer over the next hour. Shuffle a demo running order at the start of an afternoon and pull the next presenter after each break. Because the order was fixed at shuffle time, nobody can accuse the draw of being nudged partway through — the sequence was set before anyone knew what it was.

The catch: the queue freezes when you shuffle

The flip side of a persistent queue is that it's a snapshot, and it's worth knowing before it surprises you. The queue is built at the moment you press Shuffle queue. Editing the list afterwards — adding a late arrival, deleting someone who left — does not change the queue that's already running. Your new name won't appear no matter how many times you press Next, because it wasn't in the list when the shuffle happened.

The counter is what gives it away. It reads something like 14 item(s) · 9 remaining, and those two numbers come from different places: the item count is read live from the text box, while the remaining count comes from the frozen queue. Normally they move together. If you've edited the list mid-draw, they'll drift apart — and that mismatch is the signal that your queue is stale. The fix is simply to press Shuffle queue again, which rebuilds it from the current list and starts over from the top.

So the rule of thumb is: get the list right first, shuffle second. And if the queue empties out and you want another pass, that's a re-shuffle too — it won't silently restart on its own. (One small convenience: if you press Next ▶ with no queue at all, it shuffles for you rather than doing nothing.)

When a plain picker is still the right tool

None of this makes the queue universally better. If you're drawing a single winner, a shuffled queue is overkill — you want one flat, equal-odds draw and you're done. If you're drawing repeatedly from a pool where repeats are legitimate, independence is a feature, not a bug. And if you need a small handful of names at once rather than a paced sequence, ask for them in one go instead of clicking Next four times.

The question to ask is whether your list is a pool or a roster. Pools get sampled — the same name coming up twice is fine, because each draw is its own event. Rosters get ordered — every name appears exactly once, and the order is the output. Sequential picking is for rosters.

Try it on your next list of turns

The Sequential Random Picker runs entirely in your browser and needs no account. If your situation calls for something different, the Random Single Picker does the flat one-off draw, the Random Order Scheduler hands you the whole running order at once, and the Random Student Selector is tuned for classrooms specifically. Shuffle once, reveal slowly, and let the order do the arguing for you.

← Back to all posts

Send feedback

Found a bug, want a feature, or just say hi? Send it our way.