Daily Inspiration
Design excellence, every day.
Jury-selected work from the A' Design Award, presented fresh each morning.
Generate a random turn order for any group. Every permutation equally likely.
Arranging 8 participants in a line produces 8! (8 factorial) possible permutations: 40,320 distinct orderings. Each arrangement is equally likely when the shuffle is fair. The number grows staggeringly fast: 10 people yield 3,628,800 permutations; 20 people yield over 2.4 quintillion. A standard deck of 52 cards has 52! possible orderings, a number so large (approximately 8 × 1067) that every shuffle in the history of card games has almost certainly produced a unique sequence. The tool on this page uses the same mathematical guarantee for your group, regardless of its size.
Ronald A. Fisher and Frank Yates described a method for generating random permutations in their 1938 book Statistical Tables for Biological, Agricultural and Medical Research. Their original version was designed for pencil-and-paper execution: write the numbers, cross one out at random, write it down, repeat. In 1964, Richard Durstenfeld published the modern in-place variant that computers use today, and Donald Knuth popularized it in The Art of Computer Programming in 1969. The algorithm walks backward through the array, swapping each element with a randomly chosen earlier element (including itself). This produces every permutation with exactly equal probability in O(n) time. The version on this page feeds the algorithm with crypto.getRandomValues(), replacing pseudorandom sources with hardware-level entropy.
The order in which people appear affects perception. Researchers Miller and Krosnick documented that candidates listed first on ballots receive a measurable advantage of 1 to 3 percentage points, a phenomenon called the primacy effect. In judging competitions, later performers benefit from a complementary recency effect. Random ordering neutralizes both biases. When a teacher randomizes presentation order, a facilitator randomizes speaking turns, or a coach randomizes drill sequences, every participant receives a position drawn from the same fair distribution. The sequence carries no implicit hierarchy because it carries no human decision.
Project /order/8 on the classroom screen and shuffle. Students see their assigned number light up in sequence. Reshuffle for each activity throughout the day. Over time, every student experiences every position. For larger classes, adjust the count in the URL: /order/25 for 25 students, /order/30 for 30. Map participant numbers to a class roster that stays on the teacher's desk. The tool requires no accounts, stores no student names, and sets no cookies. Students see numbers on screen; only the teacher knows the mapping.
Every shuffle on this page runs the Fisher-Yates algorithm inside your browser using cryptographic randomness. The server delivers the page. Your device creates the permutation. No participant names ever enter the system because the tool uses numbered positions exclusively. The URL carries the group size; your device carries the randomness. Sharing the URL sends the same tool configuration, and each recipient generates their own independent shuffle.
The URL sets the group size. Change it directly:
Send the link. Recipients get the same group size and generate their own fresh shuffle.
Daily Inspiration
Jury-selected work from the A' Design Award, presented fresh each morning.
