Complete User Guide to the Random Name Picker, Fisher–Yates Crypto Shuffle & Team Generator

How Unbiased Fisher–Yates Shuffling & Hardware Randomness Work

Whether you are selecting giveaway winners from a social media comment export, calling on students in a classroom, assigning code reviewers, or splitting participants into balanced breakout groups, a fair draw requires sampling without replacement using an unbiased shuffle algorithm. Naive sorting tricks (such as sorting with random floating-point offsets) introduce subtle ordering bias; instead, this tool implements the Fisher–Yates (Knuth) shuffle powered by the browser's hardware-backed window.crypto.getRandomValues() with rejection sampling to eliminate modulo bias. Every permutation of N participants is mathematically equiprobable (1 / N!), ensuring every name in your list has an exact 1 / N probability of being picked first. A browser-based Random Name Picker runs 100% locally in your browser—with zero server uploads.

How to Pick Random Winners or Generate Teams in 3 Easy Steps

  1. Paste or Type Participant Names: Enter names one per line (or comma-separated) in Participant Names—click Remove Duplicates if you want each person entered strictly once, or leave duplicate lines in place for weighted raffle tickets.
  2. Choose Draw Winners or Team Generator Mode: Stay in Draw Random Winners and set Number of Winners to Draw (plus whether to automatically remove drawn winners from the pool), or switch to Random Team Generator to divide participants evenly across N teams.
  3. Run the Draw & Export Results: Click Pick Random Winner (or Generate Random Teams) to reveal the animated selection, then export via Copy Results or Download .txt.

Hypergeometric Draw Odds & Balanced Team Size Formulas

When drawing k distinct winners without replacement from N participants:

Single-Winner Probability = 1 / N  |  Multi-Winner Inclusion Odds (k draws) = k / N
Balanced Team Size = floor(N / T) or ceil(N / T) across T teams

Helpful Tips for Giveaways, Raffles & Classroom Draws

Worked Example: Drawing 3 distinct winners from a list of 12 participants gives each participant a 1 / 12 = 8.33% chance of taking the #1 spot and a 3 / 12 = 25.00% overall probability of being selected among the three winners.

Random Name Picker Odds, Algorithms & Feature Reference Table (16 Rows)

Use this reference table to check selection probabilities, shuffle properties, and built-in controls.

Feature / Pool Size Formula / Behavior Odds / Output Notes
10 Participants (1 Winner) 1 / 10 selection probability 10.00% per entry Small classroom or standup draw
12 Participants (Default Sample) 1 / 12 selection probability 8.33% per entry 25.00% for 3 winners
50 Participants (1 Winner) 1 / 50 selection probability 2.00% per entry Mid-size event raffle
100 Participants (5 Winners) 5 / 100 inclusion odds 5.00% per entry Sampling without replacement
500+ Participants O(N) linear Fisher–Yates shuffle Instant < 1 ms execution Handles large comment exports
Fisher–Yates Shuffle Unbiased in-place permutation All N! orders equiprobable Eliminates sort-comparator bias
Rejection-Sampled Crypto RNG window.crypto.getRandomValues() Zero modulo bias CSPRNG hardware entropy
Remove Duplicates Button Case-insensitive deduplication Preserves original casing Ensures 1 entry per person
Auto-Remove Winners Option Removes selected names after draw Supports multi-round giveaways Toggleable in dropdown
Random Team Generator Mode Round-robin distribution after shuffle Balanced team sizes (±1) Switch mode in top bar
Comma or Newline Parsing Splits on line breaks or commas Trims whitespace automatically Ignores blank lines
Copy & Download Results .txt / Clipboard Exports ranked winners or teams Local plain-text output
Client-Side Engine Browser JavaScript CSPRNG & Fisher–Yates Shuffler — Zero Server Latency
Server Uploads None — Your participant lists and winners stay locally in your browser
Privacy Status 100% Local Processing — Zero names or attendee lists transmitted
No Sign-Up Required Instant browser access with zero registration

Spinning a visual wheel, generating strong passwords, running a Pomodoro timer, or creating QR codes? Explore our companion client-side tools:

Frequently Asked Questions

It shuffles the participant pool using the Fisher–Yates algorithm driven by window.crypto.getRandomValues() with modulo-bias rejection—guaranteeing that every entry has an identical probability of selection.
Yes! Click Random Team Generator at the top of the studio, enter the desired number of teams, and click Generate Random Teams to distribute everyone evenly across groups.
Never. All shuffling, deduplication, and team assignments run 100% client-side inside your browser.
Yes! It is completely free with no sign-up required.