Generate random rearrangements of a short word while counting distinct permutations correctly.
The frame below runs the same code as this page, in the reader's own browser. Nothing is sent to us, and nothing is sent to you.
Pick a dark background and the text and panels follow it, so the frame stays readable on a dark page.
Letters are randomized with Fisher–Yates shuffles and duplicate strings are removed until the requested limit is reached. The possible count uses the multinomial formula n! divided by each repeated letter count factorial, then excludes the unchanged input from the returned alternatives.
listen
Anagrams: ielsnt, sitnle, snliet, tnslie, nsleti, nsteil, ilestn, setinl, neistl, senlit, lesint, ltinse, ltneis, tinlse, leinst, slitne, etilns, inltse, letnis, elsint Total possible: 719
Word games, anagram puzzles, and test data generation use shuffled letter arrangements.