Round-Robin Pair Generator
Schedule rounds where everyone pairs with everyone else exactly once.
Overview
The Round-Robin Pair Generator schedules rounds so that every participant pairs with every other participant exactly once. Paste a list of names, hit generate, and the tool returns a printable schedule of rounds — perfect for chess tournaments, speed-dating events, conversation circles and code-review pair rotations.
The generator is aimed at tournament organisers, community managers running networking events, engineering leads rotating pair-programming partners and conference organisers planning unconference sessions. Long-tail searches like "round robin tournament scheduler online", "everyone pairs with everyone once", and "pair programming rotation generator" all resolve here.
How it works
The classic round-robin scheduling algorithm fixes one participant at the top of a circle and rotates the rest around it. With N participants (even), each round produces N/2 pairs and the tournament needs N-1 rounds for everyone to meet everyone else. For odd N, the algorithm adds a "bye" placeholder so each participant gets one round off across the schedule.
The tool implements the standard "rotating polygon" form: arrange participants in two rows facing each other, hold one corner fixed and rotate the rest one position per round. The result is mathematically guaranteed to produce every pair exactly once with the minimum possible number of rounds. Output is a tidy grid of rounds with each pair labelled, plus optional shuffled ordering using the OS cryptographic random source so the first-round pairings are not always alphabetical neighbours.
Examples
4 names → 3 rounds, 2 pairs per round
6 names → 5 rounds, 3 pairs per round
7 names (odd) → 7 rounds, one bye per round per person
Shuffled start → first round pairs are random, schedule still complete
FAQ
Does everyone really pair with everyone exactly once?
Yes — that is the defining property of a single round-robin. For N participants the schedule has N(N-1)/2 total pairings.
What if I have an odd number of participants?
The tool inserts a virtual "bye" slot, so each round has one person sitting out. Across the schedule everyone gets exactly one bye.
How many rounds will it take?
For even N you need N-1 rounds. For odd N you need N rounds (each including one bye).
Can I export the schedule?
Yes. Copy as plain text, Markdown or CSV. The Markdown export renders nicely on GitHub.
Can I run a double round-robin?
Yes. Generate the schedule once for the home leg and once with the colours swapped for the return leg, common in chess and football tournaments.