nutilz
๐ŸŽฒ

Random Name & Team Picker

Pick random names or split a list into balanced teams

๐Ÿ”’ No upload โ€” runs entirely in your browser. Your names never leave your device.

What is the Random Name & Team Picker?

The Random Name & Team Picker is a free browser-based tool that removes bias and subjectivity from any selection process. Paste a list of names โ€” one per line โ€” then choose between two modes: Pick Mode lets you select a specific number of names at random, while Team Mode divides the entire list into as many balanced groups as you specify. Results appear instantly because every calculation runs inside your browser with no server roundtrip and no data transmitted.

The tool uses the Fisher-Yates shuffle algorithm โ€” the mathematical gold standard for generating uniformly random permutations. Every permutation of your list is equally likely, so every name has an identical probability of being selected. This is a fundamentally different guarantee from ad hoc methods like closing your eyes and pointing, picking alphabetically, or letting people self-select.

Teachers use this tool to call on students equitably during lessons and to assign project groups. Sports coaches use it to form practice squads without the social dynamics of traditional team-picking. Giveaway hosts use it to select contest winners transparently. HR teams use it to randomise interview panel assignments. Office meeting facilitators use it to rotate who takes notes or leads the session. Wherever fairness and impartiality matter, this tool delivers a verifiable, repeatable process in seconds.

How to Pick Random Names from a List

  1. 1.Select "Pick Names" mode (it is the default when you open the tool).
  2. 2.Paste your list of names into the text area โ€” one name per line. Names can contain spaces, numbers, or special characters; each line is treated as a single entry.
  3. 3.Set "How many to pick" to the number of names you want selected. If you enter a number larger than your list, the tool automatically returns every name without error.
  4. 4.Click the "Pick Names" button. The tool shuffles the list using Fisher-Yates and displays the top N results in a results panel below the button.
  5. 5.Click "Shuffle Again" at any time to get a fresh selection from the same list without re-entering any names.

If your list changes frequently โ€” for example, a classroom attendance list that varies day to day โ€” paste the updated list and the tool handles the rest. Nothing is saved between sessions, so each use starts completely clean.

How to Split a List into Balanced Teams

  1. 1.Click the "Make Teams" button at the top of the tool to switch to Team Mode.
  2. 2.Paste your list of names, one per line.
  3. 3.Enter the number of teams you want to create in the "Number of teams" field.
  4. 4.Click "Make Teams." The tool shuffles the list randomly, then assigns names using round-robin distribution: person 1 goes to Team 1, person 2 to Team 2, and so on, cycling back to Team 1 after all teams have received their first member.
  5. 5.Each team is displayed in its own colour-coded card showing every member.

The round-robin distribution after a random shuffle guarantees the teams are as balanced as possible. If the list does not divide evenly, the first teams receive the extra members โ€” but no team ever has more than one extra person compared to any other. For example, 13 people split into 4 teams gives Team 1 and Team 2 four members each and Team 3 and Team 4 three members each. Click "Shuffle Again" for a completely different balanced arrangement of the same names.

When to Use Pick Mode vs Team Mode

Pick Mode is ideal when you need to choose a subset from a larger pool: calling on 3 students from a class of 30, selecting 5 raffle winners from 200 entries, or picking 2 people to present at a meeting. The names not selected simply don't appear in the results.

Team Mode is ideal when every name must appear in a result: dividing a whole class into project groups, splitting a team of coworkers into breakout sessions, or creating balanced sides for a game where everyone participates. No name is left out. Both modes support "Shuffle Again" to produce different, equally valid results from the same input โ€” useful when you want to run multiple rounds or rotations.

Real-World Use Cases

Teachers and Educators

Random selection is a classroom equity technique recommended by many instructional frameworks. When you call on students the same way every lesson โ€” starting at the front row, always picking eager hand-raisers, or working alphabetically โ€” certain students get proportionally more practice than others. Cold calling with a random picker ensures every student is called on with equal frequency over time, which research links to higher engagement and reduced perceived bias in participation.

Team Mode is equally valuable for project assignments. Self-selected groups often reproduce existing social cliques and leave quieter students isolated. Randomly assigned groups expose students to peers they would not naturally work with, building broader communication skills and reducing in-group bias. Many educators assign groups randomly at the start of each unit specifically to give students fresh collaboration experiences throughout the year.

Sports Coaches and Game Organizers

Practice drills often require splitting a squad into even sides. If the coach always picks the teams manually, athletes may feel โ€” rightly or wrongly โ€” that bias has influenced the groups. Using a random picker makes the process visibly fair and takes social pressure off the coach. Some coaches randomise teams at every training session specifically to improve overall squad cohesion, because players develop better on-field understanding with teammates they rotate with frequently rather than always playing in the same group.

For informal games โ€” backyard soccer, pickup basketball, office tournaments โ€” the random picker eliminates the awkward "captain's pick" system where lower-skilled players are chosen last. Everyone enters the list equally and is distributed fairly across teams, which is more enjoyable for everyone involved.

Giveaways and Contests

Online giveaway hosts often need to select one or more winners from a pool of eligible entries. Pasting participant names into the random picker and recording a screen capture of the result provides a simple, transparent audit trail that is easy to share with participants. Unlike automated lottery software that requires technical setup or account creation, this tool works in any browser within seconds.

For hosts who want to show the selection live on a stream or in a video, clicking "Shuffle Again" on camera produces a visible, spontaneous result that audiences can watch in real time, which builds trust in the contest's fairness.

Workplace and Meeting Facilitation

Rotating meeting roles โ€” facilitator, timekeeper, note-taker โ€” randomly distributes the administrative burden of running meetings fairly rather than letting it fall to the same person repeatedly. Teams that rotate roles report more equitable participation and less meeting fatigue. Random pairing for mentorship programs, peer code reviews, or innovation sprints produces cross-functional connections that structured assignments rarely create. When people from different departments are paired by chance, knowledge-sharing happens across silos that might otherwise never interact.

Why Fisher-Yates Gives Truly Fair Results

The Fisher-Yates shuffle โ€” independently described by Ronald Fisher and Frank Yates in 1938 and later optimised by Donald Knuth in The Art of Computer Programming โ€” generates a uniformly random permutation of any array. "Uniform" means every one of the n! possible orderings of the list is equally probable. In practical terms, no name is more likely to end up first or last; every arrangement is an equally valid outcome.

Compare this to naive methods. Shuffling by generating a random number for each name and sorting by those numbers sounds similar but does not produce a uniform distribution because of floating-point ties and sort algorithm behaviour. Selecting names one at a time and placing them back in the pool allows the same name to be selected multiple times. Neither approach is suitable for fair picks without replacement.

Fisher-Yates iterates the array from the last element backward, swapping each element with a randomly chosen element from the positions at or before it. Each element is visited exactly once, making the algorithm run in O(n) time โ€” linear in the size of the list. Even a list of 10,000 names shuffles in well under a millisecond in a modern browser.

Tips for Common Edge Cases

Duplicate names: If two participants share the same name, add a distinguishing detail โ€” "Alice (Grade 6)" and "Alice (Grade 7)" โ€” so results are unambiguous and each person can be identified uniquely.

Odd-sized teams: When names don't divide evenly, Team Mode assigns the extra names to the first teams in order. If you prefer all teams to be identical in size, remove the extra names from the list before running Team Mode and handle them separately.

Re-running without replacement across rounds: If you need multiple rounds of picking without selecting the same names twice across rounds, remove already-selected names from the list between runs. The tool starts fresh each time you click the button.

Very small lists: With only two names, Pick Mode selects one and leaves the other; Team Mode creates two teams of one each. Both modes work correctly at this minimum, though the results are less surprising. The tool requires at least two names to prevent trivially certain outcomes.

Frequently Asked Questions

How does the random name picker work?+
Paste or type your names โ€” one per line โ€” into the input box. Choose whether you want to pick a set number of random names or split the entire list into balanced teams. Click the action button and the tool uses the Fisher-Yates shuffle algorithm to produce a statistically fair, unbiased selection. Every name has an equal probability of being chosen, and results are produced instantly in your browser without sending any data to a server.
Can I use this tool to create balanced teams?+
Yes. Switch to Team Mode using the button at the top of the tool, then enter the number of teams you want. The tool shuffles your list using the Fisher-Yates algorithm and distributes names across the teams using round-robin assignment โ€” person 1 to Team 1, person 2 to Team 2, and so on. If your list doesn't divide evenly, the extra names fill the first teams, so no team ever has more than one extra member compared to any other.
Is the selection truly random?+
Yes. The tool uses the Fisher-Yates (Knuth) shuffle, the mathematically proven method for generating uniformly random permutations. Every possible ordering of your list is equally likely, so every name has an identical probability of being selected. The shuffle runs in your browser using JavaScript's Math.random(), which is a cryptographically seeded pseudo-random number generator in all modern browsers.
Can the same name appear twice in a single pick?+
No. Each name can only be selected once per pick. The picker shuffles the entire list and selects from the top without replacement, so every chosen name is unique within a single result. If you need to allow repeated selections โ€” for example, sampling with replacement for a simulation โ€” add the same name multiple times to the input list.
How many names can I add?+
There is no enforced limit. The tool handles hundreds of names without any performance issues because all processing happens locally in your browser using an O(n) algorithm. No data is transmitted to a server, so even a slow internet connection doesn't affect the speed of results.
Does the tool save my names?+
No. Your list of names exists only in the browser's memory while the page is open. Nothing is sent to a server, stored in cookies, written to local storage, or saved in any database. When you close the tab or navigate away, the list is gone completely.
What is the fairest way to split a group into teams?+
The fairest method is a random shuffle followed by round-robin assignment โ€” exactly what this tool does in Team Mode. Each person is equally likely to end up in any team, and the distribution is as balanced as mathematically possible given the group size. This is preferable to self-selection (which reproduces social cliques) or any manual method (which introduces unconscious bias from the person assigning the teams).