Description
Place exact fictional resource quotas on a supplied cell graph under symmetric adjacency exclusions, reporting resource components; bounded nonuniform search, not geology.
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.
Place exact fictional resource quotas on a supplied cell graph under symmetric adjacency exclusions, reporting resource components; bounded nonuniform search, not geology.
When to use this tool
Use this generator to create reproducible world resource deposit layout 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 cellIds, edges, resources 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 cells, edges, resourceComponents, fictional. Use the conventions below and keep answer-bearing fields separate when presenting an exercise.
Expand each fictional resource quota into placement slots and use randomized bounded backtracking to assign unoccupied cells. Reject a neighboring pair when either resource forbids the other; retain unused cells as null and report same-resource connected components.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| cellIds | Cell Ids | Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 64.; minimum items 1; maximum items 12. |
| 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. |
| resources | Resources | Required. Array of Object; no unknown keys.; minimum items 1; maximum items 8. |
| resources[].id | Literal identifier used to match records, independently of their display labels. | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64. |
| resources[].count | Requested count; the mechanics explain whether one draw expands into several returned records. | Required. Safe integer; minimum 0; maximum 12. |
| resources[].forbidNeighborWithIds | Forbid Neighbor With Ids | Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 64.; minimum items 0; maximum items 8. |
| 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 |
|---|---|---|
| cells | Cells | Required. Array of Object; no unknown keys.; minimum items 1; maximum items 12. |
| cells[].id | Literal identifier used to match records, independently of their display labels. | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64. |
| cells[].resourceId | Resource Id | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64. or Null. |
| 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. |
| resourceComponents | Resource Components | Required. Array of Object; no unknown keys.; minimum items 1; maximum items 8. |
| resourceComponents[].id | Literal identifier used to match records, independently of their display labels. | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64. |
| resourceComponents[].count | Requested count; the mechanics explain whether one draw expands into several returned records. | Required. Safe integer; minimum 0; maximum 12. |
| resourceComponents[].components | Component loading vectors in component order, each aligned with the original feature columns. | Required. Safe integer; minimum 0; 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.
{
"input": {
"cellIds": [
"a",
"b",
"c"
],
"edges": [
{
"from": "a",
"to": "b"
},
{
"from": "b",
"to": "c"
}
],
"resources": [
{
"id": "amber",
"count": 2,
"forbidNeighborWithIds": [
"amber"
]
},
{
"id": "iron",
"count": 1,
"forbidNeighborWithIds": []
}
],
"seed": 42
},
"output": {
"cells": [
{
"id": "a",
"resourceId": "amber"
},
{
"id": "b",
"resourceId": "iron"
},
{
"id": "c",
"resourceId": "amber"
}
],
"edges": [
{
"from": "a",
"to": "b"
},
{
"from": "b",
"to": "c"
}
],
"resourceComponents": [
{
"id": "amber",
"count": 2,
"components": 2
},
{
"id": "iron",
"count": 1,
"components": 1
}
],
"fictional": true,
"randomness": {
"seed": 42,
"source": "seed"
}
}
} Limitations and assumptions
- The supplied graph and resource counts define the constraints. The search is not uniform over feasible assignments, and resource labels do not model geological formation or real extraction potential.
- 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
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.