Last updated: May 2026
Add names below and instantly pick one at random. Perfect for classroom draws, giveaways, team assignments, or any decision you want to leave to chance.
A random name picker selects one or more items from a list with equal probability — every entry has the same chance of being chosen. The mechanics are straightforward: assign each name a number, generate a random integer in that range, and return the corresponding name. What makes a picker "fair" is the underlying random number generator. A high-quality pseudo-random or cryptographically secure generator ensures no name is systematically favored, making the tool suitable for classroom cold-calls, team assignments, prize draws, and any decision where perceived fairness matters.
One important design choice is whether to pick with or without replacement. Picking "with replacement" means the same name can be selected again immediately — like drawing a card, putting it back, and drawing again. Picking "without replacement" removes each selected name from the pool so it cannot be chosen again. The latter is essential for raffles and tournament brackets where each participant should have exactly one chance. This picker supports both modes: clear a name after picking to remove it, or leave the list intact to allow repeat picks.
| Use Case | Typical List Size | Method | Notes |
|---|---|---|---|
| Classroom cold-call | 15–35 students | Without replacement | Ensures every student is called before repeats |
| Team assignment | 10–50 names | Without replacement, pick N | Divide list into equal groups |
| Raffle / prize draw | 10–10,000 entries | Without replacement | Each ticket has one shot; remove winner from pool |
| Group discussion order | 4–20 people | Full shuffle | Random ordering of all names |
| Daily chore rotation | 2–8 people | With replacement | Any person can be picked each day |
| Game show / trivia | 2–10 contestants | Without replacement | Pick order or elimination order |
| Survey sampling | 100–1,000+ | Without replacement | Statistical random sample; avoid duplicates |
Is the random name picker truly random?
The picker uses JavaScript's built-in random number generation, which produces pseudo-random results. For classroom draws, raffles, and games, this is statistically fair — no name is systematically favored. If you need cryptographic-grade randomness for high-stakes decisions, a dedicated lottery system with hardware entropy is more appropriate. For everyday use, this picker is as fair as rolling a die.
Can the same name be picked twice?
That depends on whether you remove names after picking (without replacement) or leave them in (with replacement). By default, names stay in the pool and can be picked again. To prevent repeats, delete or strike out each name as it's selected. This is the standard approach for raffles and full-class rotations where every participant should be picked exactly once before any name repeats.
How do I run a fair raffle with this tool?
Enter each participant's name once per ticket they hold (if tickets are equal, enter each name once). Click Pick and record the winner. Remove the winner's name from the list before the next draw. Repeat for each prize. Announce the results publicly and keep a record of picks for transparency. For very large raffles, consider entering ticket numbers instead of names for easier list management.
What is the difference between selection with and without replacement?
With replacement: after a name is picked, it goes back into the pool. The probability of being picked stays the same each round. Without replacement: picked names are removed. The pool shrinks with each pick, and each remaining name's probability increases slightly. Raffles, surveys, and ordered sequences use without replacement. Repeated random checks or simulations often use with replacement.
How can I ensure everyone gets picked an equal number of times over many rounds?
Use a "shuffle all" approach: randomize the entire list into a new order, then work through it from top to bottom. Once everyone has been picked once, shuffle again for the next round. This guarantees perfectly equal distribution over complete cycles. It's the same logic as shuffling a deck of cards and dealing through it — everyone gets one card per deck before the deck is reshuffled.