Description
Link supplied imaginary islands only through shared caller transport modes with exact edge count and optional connectivity; nonuniform construction, no geographic or transport 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.
Link supplied imaginary islands only through shared caller transport modes with exact edge count and optional connectivity; nonuniform construction, no geographic or transport claims.
When to use this tool
Use this generator to create reproducible fictional island archipelago 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 islands, candidates, edgeCount, connected 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 islands, links, componentCount, fictional. Use the conventions below. Keep answer-bearing fields separate when presenting an exercise.
Keep candidate island links only when their endpoints share a transport-mode ID. Sample the requested edges, optionally requiring connectivity, and choose a shared mode for each retained link.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| islands | Islands | Required. Array of Object; no unknown keys.; minimum items 1; maximum items 16. |
| islands[].id | Literal identifier used independently of display labels. | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64. |
| islands[].availableModeIds | Available Mode Ids | Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 64.; minimum items 1; maximum items 8. |
| 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. |
| connected | Connected | 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 |
|---|---|---|
| islands | Islands | Required. Array of Object; no unknown keys.; minimum items 1; maximum items 16. |
| islands[].id | Literal identifier used independently of display labels. | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64. |
| islands[].availableModeIds | Available Mode Ids | Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 64.; minimum items 1; maximum items 8. |
| links | Links | Required. Array of Object; no unknown keys.; minimum items 0; maximum items 64. |
| links[].from | From | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64. |
| links[].to | To | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64. |
| links[].modeId | Mode Id | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64. |
| 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.
{
"input": {
"islands": [
{
"id": "a",
"availableModeIds": [
"boat"
]
},
{
"id": "b",
"availableModeIds": [
"boat",
"air"
]
},
{
"id": "c",
"availableModeIds": [
"air"
]
}
],
"candidates": [
{
"from": "a",
"to": "b"
},
{
"from": "b",
"to": "c"
},
{
"from": "a",
"to": "c"
}
],
"edgeCount": 2,
"connected": true,
"seed": 42
},
"output": {
"islands": [
{
"id": "a",
"availableModeIds": [
"boat"
]
},
{
"id": "b",
"availableModeIds": [
"boat",
"air"
]
},
{
"id": "c",
"availableModeIds": [
"air"
]
}
],
"links": [
{
"from": "a",
"to": "b",
"modeId": "boat"
},
{
"from": "b",
"to": "c",
"modeId": "air"
}
],
"componentCount": 1,
"fictional": true,
"randomness": {
"seed": 42,
"source": "seed"
}
}
} Limitations and assumptions
- Mode compatibility is supplied metadata, not a physical transport feasibility calculation. The connected option can be infeasible even when enough raw edges exist; travel times and geographic distances are omitted.
- 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
Similar or alternative tools
- 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.
- Random Fictional River Town Network Generator
Construct a connected fictional settlement graph with distinct ordinal elevations and strictly descending river edges, retaining upstream/downstream reachability; not hydrology.