Random Team Generator

How It Works

Type one name per line, pick either a team count (2–10) or a fixed team size, and the tool deals the groups immediately: the list is shuffled first, then walked cyclically so each person takes one card. Every change — a name, the mode, the number — re-deals right away, and the Reshuffle button rolls a completely new layout.

Fisher-Yates with Web Crypto

The shuffle is the classic Fisher-Yates (Knuth) algorithm: walking the array once, each position swaps with a uniformly random earlier one. Randomness comes from crypto.getRandomValues with rejection sampling — values that would skew the distribution near the top of the 32-bit range are discarded and redrawn — so the draw is cryptographically unbiased, not just approximately random.

Round-robin dealing

After shuffling, name 1 goes to team 1, name 2 to team 2, and so on, wrapping around. Because the deck order is already random, dealing in fixed rotation produces groups that are individually unpredictable and jointly as equal in size as the numbers allow: no team can end up with two more people than another.

Why shuffle-then-split beats picking

Pulling people into teams one at a time with a fresh random choice tends to produce lumpy group sizes and depends on the order teams are filled in. A single unbiased shuffle followed by cyclic dealing removes both problems, and it is exactly how you would do it with a deck of cards.

Frequently Asked Questions