Random Fictional Migration Story Map Generator

Description

Construct exact fictional group walks over caller travel links, with optional distinct stops and supplied event hooks; bounded nonuniform path search, no demographic prediction.

Worldbuilding fixtures describe an invented setting through supplied entities and explicit relations. A reproducible arrangement can support games or writing exercises while keeping constructed history and geography separate from factual claims about the real world.

Construct exact fictional group walks over caller travel links, with optional distinct stops and supplied event hooks; bounded nonuniform path search, no demographic prediction.

When to use this tool

Use this generator to create reproducible fictional migration story map 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 nodeIds, travel, groups, stopCount, noRepeat, eventHooks 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 journeys, componentCount, fictional. Use the conventions below. Keep answer-bearing fields separate when presenting an exercise.

For each fictional group, use bounded search to construct a walk through undirected supplied travel links, optionally forbidding repeated nodes. Sample a story hook for each stop and report components of the supplied travel network.^[1]

Input field	Meaning and units	Accepted input
nodeIds	Node Ids	Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 64.; minimum items 1; maximum items 16.
travel	Travel	Required. Array of Object; no unknown keys.; minimum items 0; maximum items 64.
travel[].from	From	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
travel[].to	To	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
groups	Groups	Required. Array of Object; no unknown keys.; minimum items 1; maximum items 8.
groups[].id	Literal identifier used independently of display labels.	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
groups[].startNodeId	Start Node Id	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
stopCount	Stop Count	Required. Safe integer; minimum 1; maximum 32.
noRepeat	No Repeat	Required. Boolean.
eventHooks	Event Hooks	Required. Array of Object; no unknown keys.; minimum items 1; maximum items 16.
eventHooks[].id	Literal identifier used independently of display labels.	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
eventHooks[].text	Text	Required. Text; maximum UTF-16 length 1024.
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
journeys	Journeys	Required. Array of Object; no unknown keys.; minimum items 1; maximum items 8.
journeys[].groupId	Group Id	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
journeys[].stops	Stops	Required. Array of Object; no unknown keys.; minimum items 1; maximum items 32.
journeys[].stops[].number	Number	Required. Safe integer; minimum 1; maximum 32.
journeys[].stops[].nodeId	Node Id	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
journeys[].stops[].hookId	Hook Id	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
journeys[].stops[].hookText	Hook Text	Required. Text; maximum UTF-16 length 1024.
componentCount	Component Count	Required. Safe integer; minimum 1; maximum 16.
fictional	Fictional	Required. Boolean; exactly true.
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.

json

{
  "input": {
    "nodeIds": [
      "a",
      "b",
      "c"
    ],
    "travel": [
      {
        "from": "a",
        "to": "b"
      },
      {
        "from": "b",
        "to": "c"
      }
    ],
    "groups": [
      {
        "id": "g",
        "startNodeId": "a"
      }
    ],
    "stopCount": 3,
    "noRepeat": true,
    "eventHooks": [
      {
        "id": "arrive",
        "text": "Arrive"
      },
      {
        "id": "depart",
        "text": "Depart"
      }
    ],
    "seed": 42
  },
  "output": {
    "journeys": [
      {
        "groupId": "g",
        "stops": [
          {
            "number": 1,
            "nodeId": "a",
            "hookId": "depart",
            "hookText": "Depart"
          },
          {
            "number": 2,
            "nodeId": "b",
            "hookId": "arrive",
            "hookText": "Arrive"
          },
          {
            "number": 3,
            "nodeId": "c",
            "hookId": "depart",
            "hookText": "Depart"
          }
        ]
      }
    ],
    "componentCount": 1,
    "fictional": true,
    "randomness": {
      "seed": 42,
      "source": "seed"
    }
  }
}

Limitations and assumptions

A group cannot reach a disconnected region unless a supplied link permits it. First-feasible walks are not uniformly sampled or optimized migration routes, and hooks are supplied fictional material.
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

Tool behavior and example: Random Fictional Migration Story Map Generator — tool.io

Similar or alternative tools

Random Fictional Faction Alliance Map Generator
Generate supplied fictional factions' ally, rival, or neutral pair network with bounded topology search and same or independent reciprocal labels.
Random Fictional Language Contact Map Generator
Assign supplied invented languages to regions with minimum coverage quotas, then label caller contact edges; constructed nonuniform allocation, not real sociolinguistic inference.