Random World Portal Network Generator

Description

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.

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.

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.

When to use this tool

Use this generator to create reproducible world portal network 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 locations, flagIds, initialFlagIds, start, candidates, portalCount, requiredLocationIds 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 portals, reachableLocationIds, witnesses, exploredStateCount, componentCount, fictional. Use the conventions below and keep answer-bearing fields separate when presenting an exercise.

Search an exact-size subset of supplied directed portal candidates. Analyze each subset by breadth-first traversal of location-and-held-flag states: visiting a location accumulates its grants, and a portal opens only when required flags are held. Return independently reachable destinations with path/flag witnesses.^[1]

Delegated operations used for this result: breadth first traversal. Their calculation or parsing conventions apply to the corresponding result fields.^[2]

Input field	Meaning and units	Accepted input
locations	Locations	Required. Array of Object; no unknown keys.; minimum items 1; maximum items 12.
locations[].id	Literal identifier used to match records, independently of their display labels.	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
locations[].grantsFlagIds	Grants Flag Ids	Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 64.; minimum items 0; maximum items 6.
flagIds	Flag Ids	Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 64.; minimum items 0; maximum items 6.
initialFlagIds	Initial Flag Ids	Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 64.; minimum items 0; maximum items 6.
start	Start	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
candidates	Candidates	Required. Array of Object; no unknown keys.; minimum items 0; maximum items 24.
candidates[].from	From	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
candidates[].to	To	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
candidates[].requiresFlagIds	Requires Flag Ids	Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 64.; minimum items 0; maximum items 6.
portalCount	Portal Count	Required. Safe integer; minimum 0; maximum 24.
requiredLocationIds	Required Location Ids	Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 64.; minimum items 0; maximum items 12.
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
portals	Portals	Required. Array of Object; no unknown keys.; minimum items 0; maximum items 24.
portals[].from	From	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
portals[].to	To	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
portals[].requiresFlagIds	Requires Flag Ids	Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 64.; minimum items 0; maximum items 6.
reachableLocationIds	Reachable Location Ids	Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 64.; minimum items 1; maximum items 12.
witnesses	Witnesses	Required. Array of Object; no unknown keys.; minimum items 0; maximum items 12.
witnesses[].destination	Destination	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
witnesses[].locations	Locations	Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 64.; minimum items 1; maximum items 768.
witnesses[].heldFlagIds	Held Flag Ids	Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 64.; minimum items 0; maximum items 6.
exploredStateCount	Explored State Count	Required. Safe integer; minimum 1; maximum 768.
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": {
    "locations": [
      {
        "id": "a",
        "grantsFlagIds": []
      },
      {
        "id": "b",
        "grantsFlagIds": [
          "key"
        ]
      },
      {
        "id": "c",
        "grantsFlagIds": []
      }
    ],
    "flagIds": [
      "key",
      "moon"
    ],
    "initialFlagIds": [],
    "start": "a",
    "candidates": [
      {
        "from": "a",
        "to": "b",
        "requiresFlagIds": []
      },
      {
        "from": "b",
        "to": "c",
        "requiresFlagIds": [
          "key"
        ]
      },
      {
        "from": "a",
        "to": "c",
        "requiresFlagIds": [
          "moon"
        ]
      }
    ],
    "portalCount": 2,
    "requiredLocationIds": [
      "c"
    ],
    "seed": 42
  },
  "output": {
    "portals": [
      {
        "from": "a",
        "to": "b",
        "requiresFlagIds": []
      },
      {
        "from": "b",
        "to": "c",
        "requiresFlagIds": [
          "key"
        ]
      }
    ],
    "reachableLocationIds": [
      "a",
      "b",
      "c"
    ],
    "witnesses": [
      {
        "destination": "c",
        "locations": [
          "a",
          "b",
          "c"
        ],
        "heldFlagIds": [
          "key"
        ]
      }
    ],
    "exploredStateCount": 3,
    "componentCount": 1,
    "fictional": true,
    "randomness": {
      "seed": 42,
      "source": "seed"
    }
  }
}

Limitations and assumptions

Reachability of every required destination does not imply one tour visits them all. The search is bounded and nonuniform; graph component count alone ignores flag-dependent activation.
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 Portal Network Generator — tool.io
Calculation or validation: graph/breadth-first-traversal — 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 Historical Border Change Sequence Generator
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.