Split a list of names into random pairs, or arrange a Secret Santa where everybody gives to exactly one other person and nobody draws themselves. Odd numbers can form a group of three rather than leaving somebody out.
Settings
Recent results
Generated locally in your browser — your settings and results never leave this page.
Two different problems that look alike
Pairing people up and arranging a gift exchange sound like the same task and are not. Pairing is symmetric: the group divides into twos, and being in a pair means the same thing to both people. A gift exchange is directional: you give to one person and receive from another, and those are usually different people.
The mathematics differs too. Splitting into pairs needs an even number or an explicit decision about the odd one out. A gift exchange works for any group of two or more, but has to guarantee that nobody draws their own name.
The self-draw problem
The traditional approach — everyone pulls a name from a hat — has an awkward failure mode. Somebody eventually draws themselves, and the usual fix is to start over. With a large group the chance of at least one self-draw is uncomfortably high, so the restart happens often.
Software often reproduces this by shuffling and retrying until nobody has themselves. It works, and it is unnecessary. Arranging everybody in one loop and having each person give to the next solves it by construction: the only way to give to yourself would be to be your own successor, which cannot happen in a loop of two or more.
The guarantee is structural rather than probabilistic, which means there is no retry that could take an unbounded time and no edge case where a rare arrangement slips through.
What the loop rules out
The single-loop method has one consequence worth stating: it cannot produce mutual pairs. If Alice gives to Ben, Ben gives to somebody else, never back to Alice. In a group of exactly two the loop is mutual by necessity, but beyond that, reciprocal exchanges are impossible.
Some groups prefer this — a chain feels more like a group activity than a set of private swaps. Others find it strange that two friends cannot exchange with each other. If mutual pairs are what you want, pair mode produces exactly that.
The odd person out
An odd group cannot divide into pairs, and the two reasonable answers are a group of three or somebody left over. Both are offered because both are right in different settings.
A group of three is usually better for classroom or workshop activities, where nobody should be sitting alone. Leaving one person unpaired is better for something like a chess ladder, where a three-way match makes no sense and a bye is a normal concept.
What matters is that the tool says which happened. An odd number silently producing a quietly dropped name is the outcome that causes trouble later.
Regenerating is not cheating
Sometimes an arrangement is technically valid and practically awkward — two people who see each other every day, or a pairing that repeats last month’s. Running it again is a perfectly reasonable response, because each run is independent and no information carries between them.
The caveat is fairness of process: if you keep regenerating until a specific person gets a specific partner, the result is no longer random in any meaningful sense. Regenerating to avoid an awkward arrangement is fine; regenerating to engineer a particular one is a decision, not a draw.
Privacy
Names are processed in your browser and never uploaded. There is deliberately no share link, because a link that rebuilt the assignments would reveal them to anyone who opened it.
Pairing repeatedly over a term
A single pairing is straightforward. Pairing the same group repeatedly is where it gets awkward, because independent draws will put the same two people together again sooner than anyone expects — with ten people, a repeat within three rounds is more likely than not.
There is no memory between runs here, so avoiding repeats means tracking them yourself. For a class or a team that pairs weekly, keeping a simple grid of who has worked with whom and regenerating when a repeat appears is usually enough.
Where full coverage matters — everyone works with everyone exactly once — that is a round robin rather than a series of pairings, and the round robin scheduler builds it directly.
How to use the Random Pair Generator
- Paste the names, one per line.
- Choose whether to split into pairs or arrange a Secret Santa.
- Decide what happens with an odd number — a group of three, or one person unpaired.
- Generate, then copy or export the result.
Frequently asked questions
What is the difference between the two modes?
Splitting into pairs divides the group into twos, and each pair is mutual — if Alice is with Ben, Ben is with Alice. Secret Santa is directional: everybody gives to one person and receives from a different one, forming a single loop through the group.
Can somebody draw their own name in Secret Santa?
No, and this is guaranteed rather than checked. The tool arranges everyone into one loop and passes each gift to the next person along, so drawing yourself is structurally impossible. There is no retry loop that could occasionally slip through.
What happens with an odd number of people?
You choose. Either one group of three is formed, or one person is left without a partner and the tool says who. Neither is hidden — leaving somebody out silently is the outcome worth avoiding.
Does the single-loop arrangement have a downside?
It rules out mutual pairs, where two people give to each other. Some groups consider that a feature and others miss it. If you want mutual exchanges, use pair mode instead — that produces exactly that arrangement.
Can I exclude particular pairings, like partners or housemates?
Not in this tool. Constraint-based exclusions need a more complex solver and can make an arrangement impossible in ways that are hard to explain clearly. The practical workaround is to regenerate until the result suits, since each run is independent.
Is every arrangement equally likely?
Every arrangement the method can produce is equally likely, because the list is shuffled with Fisher–Yates first. For Secret Santa that means every single-loop arrangement, which is a subset of all possible derangements — not every valid no-self-draw arrangement, but every one of this shape.
Do the names go anywhere?
No. Everything is processed in your browser, and this tool deliberately has no share link — a link that reconstructed a Secret Santa assignment would spoil it for everyone involved.
