What this tool does
The Random Name Picker / List Calculator takes any list you paste — names, numbers, or plain text tokens — and randomly selects or shuffles items from it. Use it to draw raffle winners, choose students, assign teams, randomize a playlist, or simply scramble an order. Every click produces a fresh, uniformly random result.
How to use it
Type or paste your names or options, one per line; a single line separated by commas works too. Press Spin or the Space bar. The winner is chosen first, then the wheel turns and stops on it; with reduced motion turned on in your system, the result shows at once.
Names per spin draws several different names at once. Remove the winner takes each pick off the list, so the next spin is a draw without repeats; leave it off to allow repeats. Add " *3" after an entry to give it three times the chance. Shuffle and Sort A–Z reorder the list, Copy result copies the names, and Full screen shows the wheel to a room. Copy link puts the list after the # of the address, so whoever opens it sees the same wheel. Past spins stay in this tab; turn on Save on this device to keep the list and the history in this browser.
How fair is the draw?
Every result comes from crypto.getRandomValues, the cryptographic random generator built into your browser. The tool turns those numbers into an outcome with rejection sampling, so no outcome gets an extra chance from a leftover remainder, and the animation only replays a result that was decided before it started. Nothing is sent to our server.
Random does not mean even in the short run: in ten coin flips, seven heads or more happens about one time in six. Over many draws the counts settle near the stated chances. The tool cannot prove to someone else that you did not draw again, so for a prize draw, draw in front of the people taking part.
The formula explained
Let \(N\) be the number of parsed items and \(k\) the count you request. Without repeats the tool runs a Fisher-Yates shuffle (for i from N-1 down to 1, swap item i with a random earlier item) and returns the first m = min(k, N) items, so when k is large you simply get the whole list shuffled.
$$m = \min(k, N) \quad \text{(without replacement)}$$With repeats it performs \(k\) independent draws, each choosing a random index \(j = \lfloor \text{rand}() \times N \rfloor\), so items may recur and \(k\) can exceed \(N\). Sorting uses a natural comparator: tokens that look like numbers compare numerically, everything else compares as case-insensitive text.
Worked example
List: Liam, Ethan, Haley, 34, 25, 16, A, B, C (\(N = 9\)). Pick = 9, repeats = No, sort = none. Because \(k\) equals \(N\), this is a full shuffle, so all 9 items are returned in one of \(9! = 362{,}880\) equally likely orders, for example: 34, Ethan, B, A, 25, C, Liam, 16, Haley.
Draw With vs. Without Repeats: Scenario Comparison
The table below uses a list of N = 10 distinct items. Without repeats, each item can appear at most once, so the pick count is capped at \(k = \min(\text{pick count}, n)\). With repeats, every draw is independent and any item can come up again.
| Scenario | k | Repeats setting | Possible ordered outcomes | Chance a specific item is included | Duplicates possible? |
|---|---|---|---|---|---|
| Pick 1 | 1 | Either | 10 | 10% | No |
| Pick 3, no repeats | 3 | No | 720 (10 × 9 × 8) | 30% (3/10) | No |
| Pick 3, with repeats | 3 | Yes | 1,000 (103) | 27.1% (1 − 0.93) | Yes |
| Pick 10, no repeats | 10 | No | 3,628,800 (10!) | 100% | No |
| Pick 15, with repeats | 15 | Yes | 1015 | 79.4% (1 − 0.915) | Yes |
Formulas used:
- Without repeats: outcomes \(= \dfrac{n!}{(n-k)!}\) and \(P(\text{item picked}) = \dfrac{k}{n}\).
- With repeats: outcomes \(= n^k\) and \(P(\text{item picked at least once}) = 1 - \left(1 - \dfrac{1}{n}\right)^k\).
Note that asking for 15 picks without repeats from 10 items returns only 10 results, because k is capped at n. Picking all n items without repeats is the same as shuffling the whole list.
Key Terms: Sampling, Replacement and Shuffling
- Random sample
- A subset of items chosen by chance from a larger list, so that selection does not depend on the item's position or content.
- With replacement vs. without replacement
- With replacement (repeats allowed), an item is put back after being drawn and can be chosen again. Without replacement (repeats off), a drawn item is removed from the pool, so every result is distinct.
- Uniformly random
- Every possible choice is equally likely. In a single draw from n items, each item has probability \(1/n\).
- Fisher-Yates shuffle
- A standard unbiased shuffling algorithm. Going from the end of the list to the start, it swaps the current position with a randomly chosen position at or before it. Every ordering comes out equally likely, provided the random numbers are good. Taking the first k items of such a shuffle gives a sample without replacement.
- Permutation (n!)
- One specific ordering of items. A list of n distinct items has \(n! = n \times (n-1) \times \dots \times 1\) orderings; for 10 items that is 3,628,800.
- Natural sort order
- A sort that compares embedded numbers by value rather than character by character, so "item2" comes before "item10". Plain alphabetical sorting would put "item10" first.
- Token / parsed item
- One entry extracted from your pasted text after splitting it into pieces (for example, by line) and trimming surrounding whitespace. Empty entries are ignored, and the count of remaining items is n.
FAQ
Why is my result different each time? The draw is random, so re-running gives a new order or selection on purpose.
What if I ask for more items than my list has? Without repeats the count is capped at the list size (you get the whole list shuffled). With repeats you get exactly the number you asked for.
How are commas and spaces handled? Items are split on commas and new lines, empty tokens (like a trailing comma) are dropped, and surrounding spaces are trimmed for cleaner results.