Random World Historical Border Change Sequence Generator

Description

Simulate exact ordinal fictional border changes through real ownership transfers and allowed boundary toggles, retaining every state and witness; bounded nonuniform search, not historical or geopolitical inference.

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.

When to use this tool

Use this generator to create reproducible world historical border change 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 regions, ownerIds, initialBoundaries, allowedBoundaries, eventTypes, eventCount, preserveConnectedness 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 events, snapshots, fictional. Use the conventions below and keep answer-bearing fields separate when presenting an exercise.

Start from supplied fictional ownership and allowed boundaries. Search an exact event sequence of real ownership transfers across differently owned neighbors and permitted boundary openings/closings, optionally retaining graph connectedness. Store the initial state and every resulting snapshot with event witnesses.^[1]

Input field	Meaning and units	Accepted input
regions	Regions	Required. Array of Object; no unknown keys.; minimum items 1; maximum items 12.
regions[].id	Literal identifier used to match records, independently of their display labels.	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
regions[].initialOwnerId	Initial Owner Id	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
ownerIds	Owner Ids	Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 64.; minimum items 1; maximum items 16.
initialBoundaries	Initial Boundaries	Required. Array of Object; no unknown keys.; minimum items 0; maximum items 64.
initialBoundaries[].from	From	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
initialBoundaries[].to	To	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
allowedBoundaries	Allowed Boundaries	Required. Array of Object; no unknown keys.; minimum items 0; maximum items 64.
allowedBoundaries[].from	From	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
allowedBoundaries[].to	To	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
eventTypes	Event Types	Required. Array of Text; one of "transfer", "open", "close".; minimum items 1; maximum items 3.
eventCount	Event Count	Required. Safe integer; minimum 0; maximum 16.
preserveConnectedness	Preserve Connectedness	Required. Boolean.
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
events	Events	Required. Array of Object; no unknown keys.; minimum items 0; maximum items 16.
events[].step	Step	Required. Safe integer; minimum 1; maximum 16.
events[].type	Type	Required. Text; one of "transfer", "open", "close".
events[].from	From	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
events[].to	To	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
events[].regionId	Region Id	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64. or Null.
events[].previousOwnerId	Previous Owner Id	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64. or Null.
events[].newOwnerId	New Owner Id	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64. or Null.
snapshots	Snapshots	Required. Array of Object; no unknown keys.; minimum items 1; maximum items 17.
snapshots[].step	Step	Required. Safe integer; minimum 0; maximum 16.
snapshots[].regions	Regions	Required. Array of Object; no unknown keys.; minimum items 1; maximum items 12.
snapshots[].regions[].id	Literal identifier used to match records, independently of their display labels.	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
snapshots[].regions[].ownerId	Owner Id	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
snapshots[].boundaries	Boundaries	Required. Array of Object; no unknown keys.; minimum items 0; maximum items 64.
snapshots[].boundaries[].from	From	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
snapshots[].boundaries[].to	To	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
snapshots[].componentCount	Component Count	Required. Safe integer; minimum 1; maximum 12.
fictional	Fictional	Required. Boolean; exactly true.
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": {
    "regions": [
      {
        "id": "a",
        "initialOwnerId": "north"
      },
      {
        "id": "b",
        "initialOwnerId": "south"
      },
      {
        "id": "c",
        "initialOwnerId": "south"
      }
    ],
    "ownerIds": [
      "north",
      "south"
    ],
    "initialBoundaries": [
      {
        "from": "a",
        "to": "b"
      },
      {
        "from": "b",
        "to": "c"
      }
    ],
    "allowedBoundaries": [
      {
        "from": "a",
        "to": "b"
      },
      {
        "from": "b",
        "to": "c"
      },
      {
        "from": "a",
        "to": "c"
      }
    ],
    "eventTypes": [
      "transfer",
      "open"
    ],
    "eventCount": 2,
    "preserveConnectedness": true,
    "seed": 42
  },
  "output": {
    "events": [
      {
        "step": 1,
        "type": "open",
        "from": "a",
        "to": "c",
        "regionId": null,
        "previousOwnerId": null,
        "newOwnerId": null
      },
      {
        "step": 2,
        "type": "transfer",
        "from": "a",
        "to": "b",
        "regionId": "b",
        "previousOwnerId": "south",
        "newOwnerId": "north"
      }
    ],
    "snapshots": [
      {
        "step": 0,
        "regions": [
          {
            "id": "a",
            "ownerId": "north"
          },
          {
            "id": "b",
            "ownerId": "south"
          },
          {
            "id": "c",
            "ownerId": "south"
          }
        ],
        "boundaries": [
          {
            "from": "a",
            "to": "b"
          },
          {
            "from": "b",
            "to": "c"
          }
        ],
        "componentCount": 1
      },
      {
        "step": 1,
        "regions": [
          {
            "id": "a",
            "ownerId": "north"
          },
          {
            "id": "b",
            "ownerId": "south"
          },
          {
            "id": "c",
            "ownerId": "south"
          }
        ],
        "boundaries": [
          {
            "from": "a",
            "to": "b"
          },
          {
            "from": "b",
            "to": "c"
          },
          {
            "from": "a",
            "to": "c"
          }
        ],
        "componentCount": 1
      },
      {
        "step": 2,
        "regions": [
          {
            "id": "a",
            "ownerId": "north"
          },
          {
            "id": "b",
            "ownerId": "north"
          },
          {
            "id": "c",
            "ownerId": "south"
          }
        ],
        "boundaries": [
          {
            "from": "a",
            "to": "b"
          },
          {
            "from": "b",
            "to": "c"
          },
          {
            "from": "a",
            "to": "c"
          }
        ],
        "componentCount": 1
      }
    ],
    "fictional": true,
    "randomness": {
      "seed": 42,
      "source": "seed"
    }
  }
}

Limitations and assumptions

Steps are ordinal fictional events, not historical dates or geopolitical inferences. Connectedness concerns the supplied boundary graph. Bounded search can reject infeasible event counts or exhausted work budgets.
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 World Historical Border Change Sequence Generator — tool.io

Similar or alternative tools

Random World Biome Transition Graph Generator
Assign invented biomes to a supplied cell graph with symmetric caller compatibility and required coverage through bounded nonuniform search; illustrative labels, not ecology.
Random World Portal Network Generator
Choose an exact fictional directed portal subset with activation solved over location-and-held-flag states. Required destinations are independently reachable, not one tour; bounded nonuniform search.