About

Charades depends on prompt quality. Generic word lists produce stale rounds where half the group already guesses the answer before the actor finishes their first gesture. This generator draws from a curated pool of 500+ prompts spanning 10 categories, each tagged with a difficulty tier (EASY, MEDIUM, HARD) based on abstraction level and gesture complexity. Selection uses a Fisher-Yates shuffle to guarantee uniform distribution without repeats within a session. The integrated countdown timer enforces the standard 60s acting window used in tournament-format charades.

The tool assumes a minimum group size of 4 players split into 2 teams. Prompt difficulty is classified by estimated average guess time: EASY < 20s, MEDIUM 20−45s, HARD > 45s. Note: difficulty ratings are approximations calibrated for English-speaking adults. Cultural familiarity with movie titles or public figures will vary by region.

Formulas

Prompt selection uses the Fisher-Yates (Knuth) shuffle algorithm to produce an unbiased permutation of the filtered prompt pool. For an array of n prompts, the algorithm iterates from index i = n − 1 down to 1, swapping each element with a randomly chosen element from index 0 to i.

for i = n − 1 down to 1: swap a_i with a_j, where j = floor(random() × (i + 1))

This guarantees each of the n! permutations is equally likely, producing uniform randomness with O(n) time complexity. The session history index k tracks position within the shuffled array so no prompt repeats until the entire filtered pool is exhausted, at which point the deck is reshuffled.

Where n = total prompts matching active filters, i = current iteration index, j = random swap target index, a = prompt array, k = session draw pointer.

Reference Data

Category	Example (Easy)	Example (Medium)	Example (Hard)	Prompt Count
Animals	Dog	Penguin	Chameleon	50
Actions	Running	Juggling	Procrastinating	55
Movies	Titanic	Inception	Eternal Sunshine of the Spotless Mind	55
Objects	Chair	Telescope	Kaleidoscope	50
Occupations	Teacher	Archaeologist	Cryptographer	50
Food & Drink	Pizza	Sushi	Soufflé	50
Sports	Soccer	Fencing	Curling	45
Famous People	Einstein	Cleopatra	Nikola Tesla	45
TV Shows	Friends	Stranger Things	Black Mirror	50
Books & Literature	Harry Potter	1984	One Hundred Years of Solitude	50
Total Unique Prompts				500

Frequently Asked Questions

The full filtered prompt pool is shuffled once using the Fisher-Yates algorithm. A pointer tracks the current position. Each "Next" draw advances the pointer by 1. Once all prompts are exhausted, the deck reshuffles automatically. This guarantees zero repeats until every matching prompt has appeared exactly once.

Difficulty is assigned based on three factors: word/phrase length (multi-word phrases score higher), abstraction level (concrete nouns like "Dog" are EASY; abstract concepts like "Procrastinating" are HARD), and cultural specificity (universally known items are easier than niche references). The target metric is estimated average guess time: EASY under 20 seconds, MEDIUM 20-45 seconds, HARD over 45 seconds.

Yes. The timer supports preset durations of 30, 45, 60, 90, and 120 seconds. The selected duration persists across page reloads via localStorage. Tournament charades typically use 60 seconds, but casual play often benefits from 90 seconds, especially with younger players or non-native English speakers.

The generator displays the total available prompt count for your current filter combination. If fewer than 5 prompts match, a warning appears recommending broader filters. The minimum functional pool is 1 prompt, but gameplay quality degrades significantly below 15-20 unique prompts per round.

The shuffle operates on the combined pool of all matching prompts. Distribution is proportional to category size within that pool. For example, if you select Animals (50 prompts) and Sports (45 prompts), roughly 52.6% of draws will be Animals and 47.4% Sports over a full cycle. The distribution is not forced to alternate - it is genuinely random within the shuffled sequence.

The generator uses crypto.getRandomValues() when available, falling back to Math.random() on older browsers. Crypto-grade randomness eliminates sequential patterns that Math.random() can occasionally exhibit in certain engines. Combined with Fisher-Yates shuffling, this provides statistically uniform prompt distribution suitable for competitive play.