How to use Secret Santa Assignment Maker
- List 2 to 24 distinct participants. Each completed assignment gives every person one recipient and makes each person a recipient once.
- Add Who should not draw whom rows for prohibited giver/recipient pairs. Dev > Ben forbids Dev drawing Ben; enter Ben > Dev too if both directions are prohibited.
- Generate and read the status. The tool tries random shuffles, then a bounded fallback search. An exhausted search has not decided whether an assignment exists.
- Download secret-santa-assignments.csv and secret-santa-project.json for the complete mapping. A successful result also provides secret-santa-gift-cards.pdf.
- The PDF slips print recipient names only and follow giver order from the participant list. Use the full mapping to give each slip to its correct giver; do not shuffle the slips before distributing them. The organizer can read every assignment.
Example: Secret Santa Assignment Maker
Assign gifts among Ada, Ben, Cleo, Dev and Eve while forbidding Dev from drawing Ben. The actual valid pairings can vary; all five people must give and receive once.
Options
- Exclusions
- A giver-to-recipient exclusion is directional. Enter the reverse line too when both directions should be prohibited.
- Organizer visibility
- The full result is visible to the person running the page. No invitation, authentication or private delivery service is included.
Supported inputs and limits
- 2 to 24 distinct participants with names up to 60 characters and at most 200 directed exclusion lines.
- Names are compared without case.
- Self-exclusions are already enforced; repeated or unknown-name rules are refused.
- Random draws to try is 1 to 2,000 under Advanced search limits, followed by a fallback search capped at 200,000 steps.
- Only a complete assignment gets PDF gift slips.
More details
Failure results still export CSV headings and a JSON status record.
The project JSON is not an import control.
PDF-font restrictions apply.
No messages, participant authentication, secrecy from the organizer or guarantee of uniform selection among valid assignments is provided.
Where your input is processed
This tool does not upload your inputs. See the limits for anything saved on your device.
Randomized order does not make every valid matching equally likely
The tool tries secure random shuffles and can then fall back to a deterministic search. That combined process does not guarantee uniform selection among all valid assignments. Every successful mapping still obeys self-draw and exclusion rules. Those guarantees depend on giving the printed recipient slip to the corresponding giver from the full mapping; the PDF does not print giver names.
Questions about Secret Santa Assignment Maker
Can someone draw themselves?
A completed assignment excludes self-draws.
Will the page send each result?
No. You download and distribute results yourself.
Can I exclude a couple in both directions?
Enter both directional exclusions.