Random Fantasy Trade Route Network Generator

Description

Construct connected fictional commodity-compatible market routes and draw explicit link capacities; nonuniform topology, no price, flow, or economic predictions.

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 connected fictional commodity-compatible market routes and draw explicit link capacities; nonuniform topology, no price, flow, or economic predictions.

When to use this tool

Use this generator to create reproducible fantasy trade route 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 markets, candidates, edgeCount, minimumCapacity, maximumCapacity 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 routes, totalCapacity, componentCount, fictional. Use the conventions below. Keep answer-bearing fields separate when presenting an exercise.

Keep candidate trade edges whose markets share a commodity ID, build a connected network, and draw one shared commodity and inclusive integer capacity for each route. Return the sum of route capacities and graph components.^[1]

Input field	Meaning and units	Accepted input
markets	Markets	Required. Array of Object; no unknown keys.; minimum items 1; maximum items 16.
markets[].id	Literal identifier used independently of display labels.	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
markets[].commodityIds	Commodity Ids	Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 64.; minimum items 1; maximum items 16.
candidates	Candidates	Required. Array of Object; no unknown keys.; minimum items 0; maximum items 64.
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.
edgeCount	Edge Count	Required. Safe integer; minimum 0; maximum 64.
minimumCapacity	Minimum Capacity	Required. Safe integer; minimum 0; maximum 1000000.
maximumCapacity	Maximum Capacity	Required. Safe integer; minimum 0; maximum 1000000.
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
routes	Routes	Required. Array of Object; no unknown keys.; minimum items 0; maximum items 64.
routes[].from	From	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
routes[].to	To	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
routes[].commodityId	Commodity Id	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
routes[].capacity	Capacity	Required. Safe integer; minimum 0; maximum 9007199254740991.
totalCapacity	Total Capacity	Required. Safe integer; minimum 0; maximum 9007199254740991.
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": {
    "markets": [
      {
        "id": "a",
        "commodityIds": [
          "salt"
        ]
      },
      {
        "id": "b",
        "commodityIds": [
          "salt",
          "grain"
        ]
      },
      {
        "id": "c",
        "commodityIds": [
          "grain"
        ]
      }
    ],
    "candidates": [
      {
        "from": "a",
        "to": "b"
      },
      {
        "from": "b",
        "to": "c"
      }
    ],
    "edgeCount": 2,
    "minimumCapacity": 2,
    "maximumCapacity": 5,
    "seed": 42
  },
  "output": {
    "routes": [
      {
        "from": "a",
        "to": "b",
        "commodityId": "salt",
        "capacity": 5
      },
      {
        "from": "b",
        "to": "c",
        "commodityId": "grain",
        "capacity": 2
      }
    ],
    "totalCapacity": 7,
    "componentCount": 1,
    "fictional": true,
    "randomness": {
      "seed": 42,
      "source": "seed"
    }
  }
}

Limitations and assumptions

Summed edge capacities are not end-to-end maximum flow or market demand. This is a fictional commodity network rather than pricing, trade optimization, transport feasibility, or financial guidance.
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 Fantasy Trade Route Network Generator — tool.io

Similar or alternative tools

Random Fantasy Guild Membership Network Generator
Assign fictional guild quota slots with resident caps and exclusions using bounded nonuniform bipartite search, retaining weak subgroup counts including isolated residents.
Random Fictional Postal Route Network Generator
Construct a fictional delivery graph with an exact isolated nondepot set and connected deliverable subgraph; bounded nonuniform search with BFS evidence, not real routing.