Random Narrative Time Order Puzzle Generator

Description

Shuffle supplied fictional events and force nonchronological presentation by swapping the first pair if necessary, retaining chronology and strictly earlier dependency links.

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.

Shuffle supplied fictional events and force nonchronological presentation by swapping the first pair if necessary, retaining chronology and strictly earlier dependency links.

When to use this tool

Use this generator to create reproducible narrative time order 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 events, 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 presentation, chronology, dependencies. Use the conventions below and keep answer-bearing fields separate when presenting an exercise.

Validate unique event times and predecessor references that point strictly backward in time. Shuffle the presentation, forcing a first-pair swap if it accidentally matches chronology, and return chronological IDs/times and dependency edges separately.^[1]

Input field	Meaning and units	Accepted input
events	Events	Required. Array of Object; no unknown keys.; minimum items 2; maximum items 32.
events[].id	Literal identifier used to match records, independently of their display labels.	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
events[].text	Text	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 1024.
events[].time	Time	Required. Safe integer.
events[].predecessorIds	Predecessor Ids	Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 64.; minimum items 0; maximum items 31.
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
presentation	Presentation	Required. Array of Object; no unknown keys.; minimum items 2; maximum items 32.
presentation[].id	Literal identifier used to match records, independently of their display labels.	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
presentation[].body	Body	Required. Object; no unknown keys.
presentation[].body.text	Text	Required. Text; maximum UTF-16 length 65536.
presentation[].body.lineCount	Line Count	Required. Safe integer; minimum 0; maximum 9007199254740991.
chronology	Chronology	Required. Array of Object; no unknown keys.; minimum items 2; maximum items 32.
chronology[].id	Literal identifier used to match records, independently of their display labels.	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
chronology[].time	Time	Required. Safe integer.
dependencies	Dependencies	Required. Array of Object; no unknown keys.; minimum items 0; maximum items 992.
dependencies[].from	From	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
dependencies[].to	To	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
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.

json

{
  "input": {
    "events": [
      {
        "id": "arrive",
        "text": "A ship arrives.",
        "time": 1,
        "predecessorIds": []
      },
      {
        "id": "leave",
        "text": "The ship leaves.",
        "time": 2,
        "predecessorIds": [
          "arrive"
        ]
      }
    ],
    "wrapWidth": 80,
    "seed": 42
  },
  "output": {
    "presentation": [
      {
        "id": "leave",
        "body": {
          "text": "The ship leaves.",
          "lineCount": 1
        }
      },
      {
        "id": "arrive",
        "body": {
          "text": "A ship arrives.",
          "lineCount": 1
        }
      }
    ],
    "chronology": [
      {
        "id": "arrive",
        "time": 1
      },
      {
        "id": "leave",
        "time": 2
      }
    ],
    "dependencies": [
      {
        "from": "arrive",
        "to": "leave"
      }
    ],
    "randomness": {
      "seed": 42,
      "source": "seed"
    }
  }
}

Limitations and assumptions

The answer order follows supplied timestamps, not inferred story meaning. Every event is retained and presentation is deliberately nonchronological; the answer key should be separated from the prompt.
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

Tool behavior and example: Random Narrative Time Order Puzzle Generator — tool.io

Similar or alternative tools

Random Narrative Location Transition Plan Generator
Construct fictional scene itineraries through supplied directed motivations and travel seconds, waiting for explicit setting windows when needed, with bounded feasibility search.
Random Improv Dialogue Word Ban Challenge Generator
Select supplied forbidden tokens and compatible substitute objectives with a literal checklist and disclosed matching convention; speech monitoring remains outside the tool.