Secret Santa Generator - Random Gift Assignment Picker

How to use this tool

1. Add the names of all participants.
2. Optionally add mutual exclusion pairs, such as couples who should not draw each other.
3. Click Generate, then reveal each card individually or download printable PDF slips.

How to run a Secret Santa

1. Set a spending limit: agree on a budget before assigning names. Common amounts: $20–$25 for casual groups, $50 for close friends or colleagues.
2. Enter participant names: add everyone in the group. The tool will randomly assign each person a recipient they must buy a gift for.
3. Set mutual exclusions if needed: spouses or partners typically should not draw each other. One excluded pair blocks both people from drawing one another.
4. Generate assignments: reveal each card individually while its participant is looking, or download the PDF to print one assignment slip per page. Anyone who downloads the PDF can see the full list.
5. Plan a reveal date: at the exchange event, each participant gives their gift before revealing who their Secret Santa was.

Tips for remote or online groups

• For geographically dispersed groups, set a shipping deadline 2–3 weeks before the reveal date.
• Collect wish lists or interests separately, such as in a group chat or shared document, before the draw.
• Set a theme (e.g., books only, homemade gifts, local products) to add creativity constraints and equalize perceived value.

Privacy

Participant names, mutual exclusion pairs, and assignments are processed in this browser tab. The tool never uploads or stores those values on a server. They remain in page memory and reset when you refresh or close the tab.

Exclusions and constraints

An exclusion is mutual: if Alice and Bob are an excluded pair, Alice cannot draw Bob and Bob cannot draw Alice. This suits couples, siblings, or participants who were paired in a previous year. Everyone still gives one gift and receives one gift.

For each attempt, the generator makes a copy of the participant list and shuffles it with the Fisher–Yates algorithm. It pairs each giver with the recipient in the same position, then accepts the permutation only if nobody draws themself and no excluded pair is assigned in either direction. A rejected shuffle is retried up to 1,000 times; this is random rejection sampling, not a graph-matching solver.

Gift ideas by group type

• Office ($20–$30): consumables work best - nice coffee, gourmet chocolates, a candle, or a desk plant. Avoid anything too personal.
• Family ($30–$75): sentimental items, experience gifts (tickets, cooking classes), or hobby-specific gifts based on the recipient's interests.
• Friend group ($25–$50): inside-joke items, experience gifts, or subscription boxes. A themed exchange (books only, board games only) simplifies decisions.

When the search does not find an assignment

If all 1,000 shuffled permutations are rejected, the tool reports that it did not find an assignment. That message does not prove that no valid arrangement exists: the capped random search can miss one. Try generating again or remove optional exclusions, keeping the rules that matter most to your group.