Free Secret Santa Name Generator & Picker Online

Random Secret Santa Name Generator & Picker

Paste names, choose options, and generate secure Secret Santa pairings. Use the picker to draw a random name if needed.

Enter Names (one per line or comma separated)

Options Generate full assignments (everyone assigned one recipient) Random picker (draw a random name)

Derangement = no one gets their own name (standard Secret Santa)

Prevent Self-Assign? Yes — no one gets themselves No — allow self (not recommended)

Choose Yes to enforce Secret Santa rules.

Avoid reciprocal pairs (A→B and B→A)? No Yes — avoid direct swaps

Optional for nicer surprises (may increase retries)

Max retry attempts

How many shuffle attempts to try for valid assignment (defaults to 1000)

Tip: Use names only (no emails). Duplicate names are auto-handled by appending small suffixes so every person is unique.

Secret Santa Results

Random Picker

Picked name:

What is a Secret Santa Name Generator & Picker?

A Secret Santa Name Generator & Picker is an online tool for holiday groups that automates assignment of gift recipients. It turns a list of participant names into a set of secret pairings (giver → recipient) while enforcing rules like "no self-assignments". The picker mode helps hosts draw a single random name when needed.

How to Use Secret Santa Name Generator & Picker

1. Paste or type participant names (one per line or comma-separated).
2. Choose mode: full assignments (everyone gets one recipient) or random picker (draw one name).
3. Choose options like preventing self-assignments or avoiding direct swaps.
4. Click Generate Assignments (or Pick Random Name).
5. Reveal recipients by clicking each masked item — ideal for in-person reveal or emailing later.

How the Generator & Picker Works

For full assignments the tool creates a random permutation (shuffle) of names and then maps each giver to a recipient. It repeats shuffles until constraints are satisfied (no self-assignments, no reciprocal pairs) up to a configurable retry limit. The picker simply selects a random name from the list.

Purpose & User Intent

The main purpose is to save time and avoid human bias or mistakes in Secret Santa draws. The tool is optimized for privacy (reveal-on-click) and fairness (configurable constraints), making it ideal for families, workplaces, schools, and social groups.

Examples

Example 1: Input: Alice, Bob, Carol, Dan → Generate: Alice→Dan, Bob→Carol, Carol→Alice, Dan→Bob. Example 2 (picker): Host clicks "Pick Random Name" to draw the lucky recipient for a quick raffle.

Formula / Logic (High-level)

The generator uses random shuffles: assignments = shuffle(names); then validate constraints like: - No giver matches recipient (derangement) - Optionally avoid two-cycles (A→B & B→A) If validation fails the list is reshuffled until success or until max retries reached.

Benefits

• Saves time and reduces errors in Secret Santa assignments.
• Ensures fairness and privacy with reveal-on-click.
• Customizable rules to fit group preferences.
• Downloadable CSV and copy-to-clipboard for easy sharing.

Frequently Asked Questions

1. Can the tool prevent people from getting themselves?

Yes. The default derangement option prevents self-assignments. If the list is too small (e.g., 1 name), the tool will warn you.

2. What if two people should not be assigned together (ex: partners)?

Currently the tool supports avoiding direct reciprocal swaps. For custom exclusions (A should not get B), run assignments until you get a result that satisfies manual constraints or use multiple custom runs. I can add pair-exclusion feature if needed.

3. Can I export the assignments?

Yes — use the Download CSV button to export giver→recipient pairs or Copy to clipboard to paste into email/chat.

4. Is the reveal secure for in-person draws?

Each pairing is masked; click the masked item to reveal the recipient one-by-one — ideal for in-person reveals and preserving surprise for others.

5. How many retries does the tool attempt?

By default it will try up to 1000 shuffles (configurable). If it cannot find a valid arrangement (rare), it will ask you to adjust options or increase retries.

6. Does it handle duplicate names?

Yes. Duplicate names are automatically disambiguated by appending a small suffix (e.g., "Sam (2)"). The exported CSV keeps them unique.