Description
Match supplied fictional openings and endings by shared tags, shuffle incompatible distractors, and disclose every compatible ending including alternatives outside the choices.
A structured creative brief combines a supplied bank of fictional material with explicit sequencing, timing, or compatibility rules. IDs and tags make those constraints inspectable; they do not assess the artistic meaning or quality of a scene.
Match supplied fictional openings and endings by shared tags, shuffle incompatible distractors, and disclose every compatible ending including alternatives outside the choices.
When to use this tool
Use this generator to create reproducible story opening closing pair 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 openings, endings, distractorCount, wrapWidth 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 opening, choices, compatible. Use the conventions below and keep answer-bearing fields separate when presenting an exercise.
Choose an opening having at least one shared-tag ending and enough zero-overlap distractors. Select one compatible ending, sample incompatible distractors, and shuffle the choices. Disclose every compatible ending and its shared tags, including matches outside the displayed choices.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| openings | Openings | Required. Array of Object; no unknown keys.; minimum items 1; maximum items 16. |
| openings[].id | Literal identifier used to match records, independently of their display labels. | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64. |
| openings[].text | Text | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 1024. |
| openings[].tags | Tags | Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 64.; minimum items 0; maximum items 16. |
| endings | Endings | Required. Array of Object; no unknown keys.; minimum items 1; maximum items 16. |
| endings[].id | Literal identifier used to match records, independently of their display labels. | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64. |
| endings[].text | Text | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 1024. |
| endings[].tags | Tags | Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 64.; minimum items 0; maximum items 16. |
| distractorCount | Distractor Count | Required. Safe integer; minimum 0; maximum 15. |
| wrapWidth | Wrap Width | Required. Safe integer; minimum 1; maximum 4096. |
| 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 |
|---|---|---|
| opening | Opening | Required. Object; no unknown keys. |
| opening.id | Literal identifier used to match records, independently of their display labels. | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64. |
| opening.body | Body | Required. Object; no unknown keys. |
| opening.body.text | Text | Required. Text; maximum UTF-16 length 65536. |
| opening.body.lineCount | Line Count | Required. Safe integer; minimum 0; maximum 9007199254740991. |
| choices | Choices | Required. Array of Object; no unknown keys.; minimum items 1; maximum items 16. |
| choices[].id | Literal identifier used to match records, independently of their display labels. | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64. |
| choices[].body | Body | Required. Object; no unknown keys. |
| choices[].body.text | Text | Required. Text; maximum UTF-16 length 65536. |
| choices[].body.lineCount | Line Count | Required. Safe integer; minimum 0; maximum 9007199254740991. |
| compatible | Compatible | Required. Array of Object; no unknown keys.; minimum items 1; maximum items 16. |
| compatible[].endingId | Ending Id | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64. |
| compatible[].sharedTags | Shared Tags | Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 64.; minimum items 0; maximum items 16. |
| 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": {
"openings": [
{
"id": "door",
"text": "She left home.",
"tags": [
"home"
]
}
],
"endings": [
{
"id": "return",
"text": "She returned.",
"tags": [
"home"
]
},
{
"id": "storm",
"text": "Waves rose.",
"tags": [
"sea"
]
}
],
"distractorCount": 1,
"wrapWidth": 80,
"seed": 42
},
"output": {
"opening": {
"id": "door",
"body": {
"text": "She left home.",
"lineCount": 1
}
},
"choices": [
{
"id": "storm",
"body": {
"text": "Waves rose.",
"lineCount": 1
}
},
{
"id": "return",
"body": {
"text": "She returned.",
"lineCount": 1
}
}
],
"compatible": [
{
"endingId": "return",
"sharedTags": [
"home"
]
}
],
"randomness": {
"seed": 42,
"source": "seed"
}
}
} Limitations and assumptions
- Compatibility means nonempty tag intersection only, not literary quality. An opening with insufficient distractors is ineligible; the complete compatibility key should remain separate from student prompts.
- 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 Improv Location and Occupation Pairings Generator
Draw compatible supplied fictional locations and occupations with explicit tone filtering, pair repetition policy, and occurrence counts.
- Random Nested Story Frame Generator
Build a distinct supplied storyteller stack and balanced LIFO entry/exit markers at a bounded depth; narrative quality is caller-reviewed.