Random Permutation Generator

What it does

The Random Permutation Generator shuffles either a numeric range (1…n) or your own list of items, producing full permutations or k-element partial ones — and generates multiple independent permutations in a single run. Every arrangement is equally likely, and seeded runs reproduce exactly.

Common use cases

• Randomized test ordering — shuffle test-case execution order to flush out inter-test dependencies (keep the seed to reproduce a failing order).
• Tournament and rotation orders — who-plays-when sequences, generated in bulk for a whole season (presets for single, multiple, and item-shuffle modes).
• Deck shuffling — permutations of 1–52 as reproducible card-order fixtures.
• Latin-square-style designs — multiple independent permutations for counterbalancing experiment conditions.

Settings

• Mode — numeric range (set n) or custom items (one per line).
• Kind — full permutation, or a k-element partial permutation (set the subset size).
• How many permutations — independent shuffles per run.
• Seed — the same seed and settings regenerate the identical permutations.

Privacy note

Permutations are computed locally in your browser — item lists are never uploaded. Seeded and unbiased: every ordering equally likely, none of it suitable as security randomness.

FAQ

What’s a partial (k-element) permutation? An ordered selection of k items from n — “pick 3 of 10, order matters.” Podium finishes, top-k rotations, and sampled orderings all live here.

Is the shuffle unbiased? Yes — a proper Fisher-Yates-style shuffle where all n! orderings are equally likely, a property worth asserting in statistical tests (this tool makes a good reference).

Permutation vs shuffle vs pick? Same math, different framing: List Shuffler is the one-list convenience tool; Random Picker selects without ordering; this tool does the general case — ranges, multiplicity, and partial permutations.