Description
Construct supplied fictional secret discoveries with prerequisite knowledge, eligible discoverers, bounded backtracking, and a complete per-character reveal ledger.
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.
Construct supplied fictional secret discoveries with prerequisite knowledge, eligible discoverers, bounded backtracking, and a complete per-character reveal ledger.
When to use this tool
Use this generator to create reproducible character secret reveal plan 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 characters, secrets, beats, 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 reveals, knowledge. Use the conventions below. Keep answer-bearing fields separate when presenting an exercise.
Use bounded backtracking across beats to assign an eligible discoverer a previously unknown secret whose prerequisites they already know. Update only that character's knowledge and return before/after sets and final knowledge per character.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| characters | Characters | Required. Array of Object; no unknown keys.; minimum items 1; maximum items 16. |
| characters[].id | Literal identifier used independently of display labels. | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64. |
| characters[].known | Known | Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 64.; minimum items 0; maximum items 16. |
| secrets | Secrets | Required. Array of Object; no unknown keys.; minimum items 1; maximum items 16. |
| secrets[].id | Literal identifier used independently of display labels. | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64. |
| secrets[].text | Text | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 1024. |
| secrets[].requires | Requires | Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 64.; minimum items 0; maximum items 16. |
| beats | Beats | Required. Array of Object; no unknown keys.; minimum items 1; maximum items 32. |
| beats[].id | Literal identifier used independently of display labels. | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64. |
| beats[].discovererIds | Discoverer Ids | Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 64.; minimum items 1; maximum items 16. |
| 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 |
|---|---|---|
| reveals | Reveals | Required. Array of Object; no unknown keys.; minimum items 1; maximum items 32. |
| reveals[].beatId | Beat Id | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64. |
| reveals[].discovererId | Discoverer Id | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64. |
| reveals[].secretId | Secret Id | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64. |
| reveals[].body | Body | Required. Object; no unknown keys. |
| reveals[].body.text | Text | Required. Text; maximum UTF-16 length 65536. |
| reveals[].body.lineCount | Line Count | Required. Safe integer; minimum 0; maximum 9007199254740991. |
| reveals[].knownBefore | Known Before | Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 64.; minimum items 0; maximum items 16. |
| reveals[].knownAfter | Known After | Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 64.; minimum items 0; maximum items 16. |
| knowledge | Knowledge | Required. Array of Object; no unknown keys.; minimum items 1; maximum items 16. |
| knowledge[].characterId | Character Id | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64. |
| knowledge[].secrets | Secrets | Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 64.; minimum items 0; maximum items 16. |
| randomness | Replay source and normalized 32-bit seed, or null seed for an advancing context source. | Required. Object; no unknown keys. |
| randomness.seed | Optional safe-integer 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": {
"characters": [
{
"id": "m",
"known": [
"key"
]
},
{
"id": "i",
"known": []
}
],
"secrets": [
{
"id": "key",
"text": "The key is brass.",
"requires": []
},
{
"id": "vault",
"text": "The vault is below.",
"requires": [
"key"
]
}
],
"beats": [
{
"id": "b1",
"discovererIds": [
"i"
]
},
{
"id": "b2",
"discovererIds": [
"i"
]
}
],
"wrapWidth": 80,
"seed": 42
},
"output": {
"reveals": [
{
"beatId": "b1",
"discovererId": "i",
"secretId": "key",
"body": {
"text": "The key is brass.",
"lineCount": 1
},
"knownBefore": [],
"knownAfter": [
"key"
]
},
{
"beatId": "b2",
"discovererId": "i",
"secretId": "vault",
"body": {
"text": "The vault is below.",
"lineCount": 1
},
"knownBefore": [
"key"
],
"knownAfter": [
"key",
"vault"
]
}
],
"knowledge": [
{
"characterId": "m",
"secrets": [
"key"
]
},
{
"characterId": "i",
"secrets": [
"key",
"vault"
]
}
],
"randomness": {
"seed": 42,
"source": "seed"
}
}
}Limitations and assumptions
- A secret can be revealed to several different characters. Prerequisites are character-specific supplied fiction, and the first feasible reveal sequence is not uniformly sampled or an assessment of narrative quality.
- A replay requires the same complete input and implementation. The stated sampling convention applies within its eligible space. A finite draw does not exhaust all possible outputs; repeats remain possible unless a distinct-selection rule is explicit.
- 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 Character Entry and Exit Cue Plan Generator
Build fictional cast-presence traces with exits before entries, role-doubling checks, simultaneous performer limits, and complete cue ledgers.
- Random Character Objective Conflict Matrix Generator
Assign distinct supplied fictional objectives and construct a symmetric conflict matrix from explicit incompatibility tags and caller-provided resolutions.