Description
Sample an ASCII alphanumeric character bank or caller-supplied individually palindromic words, mirror units, hide distinct positions, and return a checker-verified completion. The checker ignores case and separators; the supplied completion need not be unique and word mode requires each word to be a palindrome.
A generated practice exercise contains a prompt and an answer key under a specific rule set. A planted answer establishes one possible solution; only an explicit enumeration or uniqueness check establishes whether alternatives exist.
Sample an ASCII alphanumeric character bank or caller-supplied individually palindromic words, mirror units, hide distinct positions, and return a checker-verified completion. The checker ignores case and separators; the supplied completion need not be unique and word mode requires each word to be a palindrome.
When to use this tool
Use this generator to create reproducible palindrome construction puzzle cases from the supplied model or bank. Inspect the returned evidence before using cases in a test or exercise.
How to use the tool and how it works
- Supply mode, units, unitCount, hiddenCount in the field shapes below. Set seed when you need an explicit replay.
- Run the tool and correct any input error. For generated controls, distinguish a successful fixture containing an invalid case from failure to generate the fixture.
- Read solutionUnits, solutionText, puzzleUnits, puzzleText, hiddenIndices, checkerVerified. Use the conventions below and keep answer-bearing fields separate when presenting an exercise.
Sample half a sequence, reflect it into a palindrome, hide distinct selected positions, and delegate palindrome checking of the completed text. Word mode joins units with spaces; character mode concatenates them.1
Delegated operations used for this result: palindrome checker. Their calculation or parsing conventions apply to the corresponding result fields.2
| Input field | Meaning and units | Accepted input |
|---|---|---|
| mode | Mode | Required. Text; one of "characters", "words". |
| units | Units | Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 32.; minimum items 1; maximum items 64. |
| unitCount | Unit Count | Required. Safe integer; minimum 1; maximum 64. |
| hiddenCount | Hidden Count | Required. Safe integer; minimum 1; maximum 64. |
| seed | Optional numeric seed; takes precedence over context randomness. Without either, use the fixed tool.io default seed. | Optional. Safe integer. |
| Output field | Interpretation | Returned shape |
|---|---|---|
| solutionUnits | Solution Units | Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 32.; minimum items 1; maximum items 64. |
| solutionText | Solution Text | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 2111. |
| puzzleUnits | Puzzle Units | Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 32. or Null.; minimum items 1; maximum items 64. |
| puzzleText | Puzzle Text | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 2111. |
| hiddenIndices | Hidden Indices | Required. Array of Safe integer; minimum 0; maximum 63.; minimum items 1; maximum items 64. |
| checkerVerified | Checker Verified | Required. Boolean. |
| randomness | Replay metadata: source is seed or context; seed is the normalized 32-bit seed or null for a context source. | Required. Object; no unknown keys. |
| randomness.seed | Optional numeric replay seed; normalization and precedence are explained below. | Required. Safe integer. or Null. |
| randomness.source | Source | Required. Text; one of "context", "seed". |
An explicit safe-integer seed takes precedence over injected context randomness and is normalized to an unsigned 32-bit integer. With no seed and no context source, replay uses the fixed tool.io default seed. A context source must return finite values from zero inclusive to one exclusive; its advancing state must be retained separately. randomness records the source and normalized seed, or null for context. These generators are not cryptographic random sources.
{
"input": {
"mode": "words",
"units": [
"level",
"civic",
"radar"
],
"unitCount": 7,
"hiddenCount": 3,
"seed": 42
},
"output": {
"solutionUnits": [
"civic",
"civic",
"radar",
"radar",
"radar",
"civic",
"civic"
],
"solutionText": "civic civic radar radar radar civic civic",
"puzzleUnits": [
"civic",
null,
"radar",
null,
"radar",
"civic",
null
],
"puzzleText": "civic ____ radar ____ radar civic ____",
"hiddenIndices": [
1,
3,
6
],
"checkerVerified": true,
"randomness": {
"seed": 42,
"source": "seed"
}
}
}Limitations and assumptions
- Each supplied unit must itself satisfy the linked palindrome checker; character mode requires one UTF-16 unit. Null marks a hidden unit. The planted solution need not be the only completion.
- A replay requires the same complete input and implementation. Randomized construction does not guarantee uniform coverage of every feasible output; finite samples can repeat unless a distinct-selection rule is explicitly stated.
- The field tables state structural bounds; cross-field constraints and bounded search or output budgets also apply. Unknown keys are rejected where the object contract disallows them. Input errors are distinct from null fields and deliberate invalid controls in a successful output.
Alternative or Complementary methods
For a supplied example, inspect the returned construction or delegated check directly. To evaluate a consumer, also test cases chosen for its own boundaries; a generated finite corpus does not establish exhaustive coverage.
References
Similar or alternative tools
- Random Integer Partition Matching Puzzle Generator
Construct bounded positive or nonnegative integer compositions and optional canonical unordered partitions, retaining exact sum and conventions.
- Random Nonogram Line Completion Puzzle Generator
Generate a binary Nonogram line with hidden cells and exact bounded completion counts and forced-cell answers.