About Random List Picker

Pick a winner from a list — shows the full shuffled order too. Part of the DevTools Surf developer suite. Browse more tools in the Fun / Niche collection.

Use Cases

• Team leads picking random reviewers for code review assignments
• Teachers selecting random students for classroom participation
• Raffle organizers drawing winners from a participant list
• Agile teams randomly assigning daily standup speaking order

Tips

• Paste items one per line to enter your options list
• The full shuffled order is shown alongside the winner
• Re-run to get a fresh random pick each time

Fun Facts

• True randomness in computers is surprisingly hard — most random pickers use pseudorandom number generators (PRNGs) seeded by system entropy sources like mouse movements.
• The Fisher-Yates shuffle algorithm, published in 1938 and computerized by Richard Durstenfeld in 1964, is the standard O(n) method for generating unbiased random permutations.
• JavaScript's Math.random() uses the xorshift128+ algorithm in V8 (Chrome/Node.js) — it's fast but not cryptographically secure, which is fine for picking raffle winners.

FAQ

How random is it?

Crypto-secure. The shuffle uses Fisher-Yates with getRandomValues. Every permutation is equally likely.

Can I weight items?

Not in this tool. For weighted random selection, duplicate high-weight items in your list — e.g., a 3x weighted item appears three times.

Is the seed deterministic?

Yes — provide a seed and the same list always produces the same shuffled order. Useful for testing or fair-but-reproducible lottery drawings.

What's shown besides the winner?

The full shuffled order. The 'winner' is position 1, but you see the ranking all the way down — useful for multi-prize drawings.