Group Generator

Team Distribution System // v1.0

Enter each member name on a new line

Configuration
Total Members:0
Groups:0

Press Cmd/Ctrl + Enter ↵

How this tool helps

Enter one item per line, choose between 2 and 20 groups, and generate. Empty lines are ignored, repeated lines remain separate items, and the group count cannot exceed the number of parsed items. The tool selects Fisher–Yates indices with Web Crypto getRandomValues and rejection sampling, then assigns the shuffled items round-robin. Group sizes differ by at most 1. You can copy one group or copy all groups with the fixed Group 1, Group 2… headers. The draw uses only the text lines and group count: it does not inspect names, relationships, roles, or abilities. Each permutation is equally likely, while a participant’s probability of entering a particular group depends on that group’s output capacity when the capacities are not equal.

One-line input

2–20 groups

Size difference at most 1

Two copy actions

What does the random group generator do?

Enter one item per line, choose between 2 and 20 groups, and generate. Empty lines are ignored, repeated lines remain separate items, and the group count cannot exceed the number of parsed items. The tool selects Fisher–Yates indices with Web Crypto getRandomValues and rejection sampling, then assigns the shuffled items round-robin. Group sizes differ by at most 1. You can copy one group or copy all groups with the fixed Group 1, Group 2… headers. The draw uses only the text lines and group count: it does not inspect names, relationships, roles, or abilities. Each permutation is equally likely, while a participant’s probability of entering a particular group depends on that group’s output capacity when the capacities are not equal.

Useful for

🧑‍🏫

Teachers

Divide a roster into a chosen number of classroom groups.

🏢

Facilitators

Create breakout groups from a participant list.

Coaches

Make a first-pass draw for drills or practice groups.

🎉

Game hosts

Split players into a chosen number of game teams.

What the panel provides

01

One-line input

Each non-empty line becomes one item in the draw.

02

2–20 groups

Choose a group count that does not exceed the number of items.

03

Size difference at most 1

Round-robin assignment makes the output as even in size as the item count allows.

04

Two copy actions

Copy one group, or copy all groups with their fixed group headers.

Examples

Class roster

Paste 24 names and choose 6 groups.

The result contains 6 groups of 4.

Workshop

Paste 17 participants and choose 5 groups.

The group sizes are 4, 4, 3, 3, and 3.

Game night

Paste 12 players and choose 3 groups.

Copy one team or copy the complete three-group result.

How to use it

  1. 1.

    Enter items

    Use one item per line; blank lines are ignored.

  2. 2.

    Choose the count

    Select between 2 and 20 groups.

  3. 3.

    Generate

    The list is shuffled and dealt round-robin.

  4. 4.

    Copy

    Use the button on one group or the Copy All action.

Questions about the result

How is the shuffled order selected?

Fisher–Yates requests each index from Web Crypto getRandomValues. Rejection sampling discards the uneven Uint32 tail before reducing a value to the required range.

What is equally likely?

Each permutation is equally likely. A participant is therefore equally likely to occupy any particular position in the shuffled order.

Is every group equally likely for a participant?

Only when the groups have equal capacities. If capacities differ, groups with different capacities have different probabilities: a group containing c of n output positions receives that participant with probability c/n.

How even are the sizes?

Round-robin assignment makes any two group sizes differ by at most 1.

Does it balance skill or strength?

No. The panel uses only the entered lines and the requested group count; it has no skill or strength data.

Algorithm boundary

Web Crypto getRandomValues supplies Uint32 values. For each Fisher–Yates step, rejection sampling discards the short tail that cannot be divided evenly by the required index range; the accepted value is then reduced to that range. This removes modulo bias for the index selection, so each permutation is equally likely. Round-robin assignment maps shuffled positions 1, 2, 3… across the requested groups and then starts again at Group 1. That construction gives a size difference of at most 1. It does not evaluate relationships, roles, ability, or any other property of an item. If all capacities are equal, each item has the same probability for each group. If capacities differ, a group holding c of n positions receives a particular item with probability c/n.

Three adults use a magnetic board to distribute twelve participant tokens evenly into three randomly formed groups.
Three adults use a magnetic board to distribute twelve participant tokens evenly into three randomly formed groups.
A shuffled set of participant tokens becomes three balanced groups for a class, workshop, game, or project.