Description
Assign supplied viewpoints to chapters under exact appearance quotas and explicit knowledge requirements using bounded search and a remaining-quota trace.
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.
Assign supplied viewpoints to chapters under exact appearance quotas and explicit knowledge requirements using bounded search and a remaining-quota trace.
When to use this tool
Use this generator to create reproducible story perspective rotation 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 viewpoints, chapters, 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 chapters, finalQuotas. Use the conventions below and keep answer-bearing fields separate when presenting an exercise.
Assign viewpoints to chapters by bounded randomized backtracking. A candidate needs remaining quota and knowledge of every chapter-required tag. Decrement quotas in chapter order and return the remaining-quota trace and wrapped chapter brief.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| viewpoints | Viewpoints | Required. Array of Object; no unknown keys.; minimum items 1; maximum items 16. |
| viewpoints[].id | Literal identifier used to match records, independently of their display labels. | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64. |
| viewpoints[].quota | Quota | Required. Safe integer; minimum 0; maximum 32. |
| viewpoints[].knownTags | Known Tags | Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 64.; minimum items 0; maximum items 16. |
| chapters | Chapters | Required. Array of Object; no unknown keys.; minimum items 1; maximum items 32. |
| chapters[].id | Literal identifier used to match records, independently of their display labels. | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64. |
| chapters[].requiredTags | Required Tags | Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 64.; minimum items 0; 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 |
|---|---|---|
| chapters | Chapters | Required. Array of Object; no unknown keys.; minimum items 1; maximum items 32. |
| chapters[].chapterId | Chapter Id | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64. |
| chapters[].viewpointId | Viewpoint Id | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64. |
| chapters[].requiredTags | Required Tags | Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 64.; minimum items 0; maximum items 16. |
| chapters[].remainingQuotas | Remaining Quotas | Required. Array of Object; no unknown keys.; minimum items 1; maximum items 16. |
| chapters[].remainingQuotas[].viewpointId | Viewpoint Id | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64. |
| chapters[].remainingQuotas[].remaining | Remaining | Required. Safe integer; minimum 0; maximum 32. |
| chapters[].brief | Brief | Required. Object; no unknown keys. |
| chapters[].brief.text | Text | Required. Text; maximum UTF-16 length 65536. |
| chapters[].brief.lineCount | Line Count | Required. Safe integer; minimum 0; maximum 9007199254740991. |
| finalQuotas | Final Quotas | Required. Array of Object; no unknown keys.; minimum items 1; maximum items 16. |
| finalQuotas[].viewpointId | Viewpoint Id | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64. |
| finalQuotas[].remaining | Remaining | Required. Safe integer; minimum 0; maximum 32. |
| 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": {
"viewpoints": [
{
"id": "m",
"quota": 1,
"knownTags": [
"map"
]
},
{
"id": "i",
"quota": 1,
"knownTags": [
"gate"
]
}
],
"chapters": [
{
"id": "c1",
"requiredTags": [
"gate"
]
},
{
"id": "c2",
"requiredTags": [
"map"
]
}
],
"wrapWidth": 80,
"seed": 42
},
"output": {
"chapters": [
{
"chapterId": "c1",
"viewpointId": "i",
"requiredTags": [
"gate"
],
"remainingQuotas": [
{
"viewpointId": "m",
"remaining": 1
},
{
"viewpointId": "i",
"remaining": 0
}
],
"brief": {
"text": "Chapter c1: viewpoint i.",
"lineCount": 1
}
},
{
"chapterId": "c2",
"viewpointId": "m",
"requiredTags": [
"map"
],
"remainingQuotas": [
{
"viewpointId": "m",
"remaining": 0
},
{
"viewpointId": "i",
"remaining": 0
}
],
"brief": {
"text": "Chapter c2: viewpoint m.",
"lineCount": 1
}
}
],
"finalQuotas": [
{
"viewpointId": "m",
"remaining": 0
},
{
"viewpointId": "i",
"remaining": 0
}
],
"randomness": {
"seed": 42,
"source": "seed"
}
}
} Limitations and assumptions
- Quotas must sum to the number of chapters and all referenced tags are caller-supplied fiction. The first feasible assignment is not a uniform draw over all feasible rotations.
- 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 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.
- Random Story Beat Outline Generator
Compose supplied fictional opening, conflict, and resolution templates with checked tag continuity using bounded randomized backtracking.