Random Fictional District Adjacency Map Generator

Description

Construct a connected fictional district graph under supplied land-use and boundary exclusions using bounded, nonuniform constraint search; no zoning or geometry claims.

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 a connected fictional district graph under supplied land-use and boundary exclusions using bounded, nonuniform constraint search; no zoning or geometry claims.

When to use this tool

Use this generator to create reproducible fictional district adjacency 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 districts, boundaries, prohibitedLandUsePairs, edgeCount 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 districts, edges, rejectedBoundaries, componentCount, fictional. Use the conventions below. Keep answer-bearing fields separate when presenting an exercise.

Use bounded search to assign an allowed land use to each district, excluding boundary edges whose endpoint land-use pair is prohibited. Require the remaining candidates to support a connected network with edgeCount and return rejected boundaries separately.^[1]

Input field	Meaning and units	Accepted input
districts	Districts	Required. Array of Object; no unknown keys.; minimum items 1; maximum items 12.
districts[].id	Literal identifier used independently of display labels.	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
districts[].allowedLandUses	Allowed Land Uses	Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 64.; minimum items 1; maximum items 4.
boundaries	Boundaries	Required. Array of Object; no unknown keys.; minimum items 0; maximum items 64.
boundaries[].from	From	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
boundaries[].to	To	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
prohibitedLandUsePairs	Prohibited Land Use Pairs	Required. Array of Object; no unknown keys.; minimum items 0; maximum items 64.
prohibitedLandUsePairs[].from	From	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
prohibitedLandUsePairs[].to	To	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
edgeCount	Edge Count	Required. Safe integer; minimum 0; maximum 64.
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
districts	Districts	Required. Array of Object; no unknown keys.; minimum items 1; maximum items 12.
districts[].id	Literal identifier used independently of display labels.	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
districts[].landUse	Land Use	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
edges	Edges	Required. Array of Object; no unknown keys.; minimum items 0; maximum items 64.
edges[].from	From	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
edges[].to	To	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
rejectedBoundaries	Rejected Boundaries	Required. Array of Object; no unknown keys.; minimum items 0; maximum items 64.
rejectedBoundaries[].from	From	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
rejectedBoundaries[].to	To	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
componentCount	Component Count	Required. Safe integer; minimum 1; maximum 12.
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": {
    "districts": [
      {
        "id": "grove",
        "allowedLandUses": [
          "homes"
        ]
      },
      {
        "id": "quay",
        "allowedLandUses": [
          "market"
        ]
      },
      {
        "id": "square",
        "allowedLandUses": [
          "park"
        ]
      }
    ],
    "boundaries": [
      {
        "from": "grove",
        "to": "quay"
      },
      {
        "from": "quay",
        "to": "square"
      },
      {
        "from": "grove",
        "to": "square"
      }
    ],
    "prohibitedLandUsePairs": [
      {
        "from": "homes",
        "to": "park"
      }
    ],
    "edgeCount": 2,
    "seed": 42
  },
  "output": {
    "districts": [
      {
        "id": "grove",
        "landUse": "homes"
      },
      {
        "id": "quay",
        "landUse": "market"
      },
      {
        "id": "square",
        "landUse": "park"
      }
    ],
    "edges": [
      {
        "from": "grove",
        "to": "quay"
      },
      {
        "from": "quay",
        "to": "square"
      }
    ],
    "rejectedBoundaries": [
      {
        "from": "grove",
        "to": "square"
      }
    ],
    "componentCount": 1,
    "fictional": true,
    "randomness": {
      "seed": 42,
      "source": "seed"
    }
  }
}

Limitations and assumptions

The prohibition is symmetric under the model's unordered pair key. These are fictional adjacency constraints, not zoning law, geographic boundary geometry, or a planning recommendation.
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 District Adjacency Map Generator — tool.io

Similar or alternative tools

Random Fantasy Festival District Plan Generator
Allocate supplied fictional event types to capacity-limited districts with optional occupied-induced-graph connectivity; bounded nonuniform search, not crowd-safety planning.
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.