Random Anagram Puzzle Generator
Uniform caller word selection and uniform letter-position permutations; repeated letters and identity permutations allowed rather than retry-biased scrambling. ASCII spelling drill, not language validity or a guaranteed different anagram.
Description
An anagram rearranges a word’s letter positions, which can yield the same spelling when letters repeat or the permutation is the identity.
An anagram rearranges a word’s letter positions, which can yield the same spelling when letters repeat or the permutation is the identity.1
This puzzle generator preserves those outcomes rather than retrying until the spelling changes.
When to use Random Anagram Puzzle Generator
Use this tool when you need to produce the reproducible draw or model experiment described below. Prepare a reproducible seed and the inventory, corpus, or experiment parameters stated below.
How to use Random Anagram Puzzle Generator and understand its results
- Prepare a reproducible seed and the inventory, corpus, or experiment parameters stated below.
- Enter seed, count, candidateWords, following the field table and calculation rules below, then run the tool.
- Read result. For result objects, inspect the nested output fields below, including any missing evidence or selected indices.
- Correct any input issues and run again. Before using a successful result, review its units, signs, evidence coverage, and stated model or reference assumptions.
| Input field | Meaning | Value type | Requirement |
|---|---|---|---|
| seed | Required nonblank deterministic seed; the SDK can replace the source with context.random. | string | Required |
| count | Number of draws, cards, trials, or output entries under the tool-specific rule; safe integer 1–64 with any narrower inventory bound. | number | Required |
| candidateWords | Candidate words | list of string | Required |
Require unique supplied words of two to thirty-two ASCII letters. Draw words with replacement, then draw each word’s letter positions without replacement as a full permutation using the same advancing source. Return scrambled, answer, and unchanged for every puzzle. Case is preserved and the scramble need not be a dictionary word.2, 3
Use a nonblank seed of at most 256 UTF-16 units and a safe-integer count from 1 to 64, subject to the tool’s narrower inventory bound. By default the seed is hashed into a deterministic pseudorandom state; each run restarts that state, so identical full inputs and implementation reproduce the result. The SDK may provide context.random, which replaces the seeded source and advances across the request; the seed remains required. Every source value must be finite in [0,1), with a request limit of 100000 source calls. Draw an index as floor(U×remainingSize). For indexed inventory draws, with replacement draw from the full inventory each time; without replacement remove each chosen position from an ordered pool and reject counts exceeding the inventory size. Uniform-source draws are over positions, not necessarily distinct values. This is not secure randomness.
scrambled=join(word[position] for uniform position permutation) Read these symbols with the field meanings and branch or reference rules above.
| Output field | Meaning | Value type |
|---|---|---|
| result | Composite output; read its nested fields and the worked example. | object |
| result.puzzles | puzzles | list |
{
"input": {
"seed": "tool.io/batch42",
"count": 1,
"candidateWords": [
"cat",
"dog"
]
},
"output": {
"result": {
"puzzles": [
{
"scrambled": "odg",
"answer": "dog",
"unchanged": false
}
]
}
}
}Limitations and assumptions
The input words and answer spelling are supplied content. Repeated letters make distinct permutations render identically, and unchanged puzzles are valid outcomes.
Missing required fields, unknown fields, wrong types, and violated calculation rules return input issues. Numeric values must be finite; nonfinite numeric outputs are rejected. Arrays must be dense, with no missing cells. Ordinary string lists allow at most 128 strings of at most 128 UTF-16 units each. Extremely large composite outputs are rejected.
Alternative or Complementary methods
For a related task, use Random Caesar Cipher Puzzle Generator: A Caesar cipher rotates alphabet positions by a fixed offset. These puzzles transform supplied text while preserving case and non-ASCII-letter content; the transformation provides no cryptographic confidentiality. For a complementary step, use Random Acronym Expansion Puzzle Generator: An acronym is formed here from the initials of whitespace-separated words. These puzzles retain the original supplied phrase as a reference answer because many phrases can share the same initials.
References
-
Random Anagram Puzzle Generator — tool.io
-
Calculation or validation: random/number — tool.io
Similar or alternative tools
- Random Caesar Cipher Puzzle Generator
A Caesar cipher rotates alphabet positions by a fixed offset. These puzzles transform supplied text while preserving case and non-ASCII-letter content; the transformation provides no cryptographic confidentiality.
- Random Acronym Expansion Puzzle Generator
An acronym is formed here from the initials of whitespace-separated words. These puzzles retain the original supplied phrase as a reference answer because many phrases can share the same initials.