Description
Generate supplied fictional factions' ally, rival, or neutral pair network with bounded topology search and same or independent reciprocal labels.
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.
Generate supplied fictional factions' ally, rival, or neutral pair network with bounded topology search and same or independent reciprocal labels.
When to use this tool
Use this generator to create reproducible fictional faction alliance map 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 factions, pairCount, relationshipTypes, reciprocalPolicy, connected, maximumDegree 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 fictional, relationships, degrees, components. Use the conventions below. Keep answer-bearing fields separate when presenting an exercise.
Construct a bounded-degree relationship topology with the requested pair count and optional connectivity. Emit two directed relationship records for each unordered pair, reusing the type or sampling each direction independently according to reciprocalPolicy.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| factions | Factions | Required. Array of Object; no unknown keys.; minimum items 1; maximum items 12. |
| factions[].id | Literal identifier used independently of display labels. | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64. |
| factions[].name | Name | Required. Text; maximum UTF-16 length 2048. |
| pairCount | Pair Count | Required. Safe integer; minimum 0; maximum 32. |
| relationshipTypes | Relationship Types | Required. Array of Text; one of "ally", "rival", "neutral".; minimum items 1; maximum items 3. |
| reciprocalPolicy | Reciprocal Policy | Required. Text; one of "same", "independent". |
| connected | Connected | Required. Boolean. |
| maximumDegree | Maximum Degree | Required. Safe integer; minimum 0; maximum 11. |
| 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 |
|---|---|---|
| fictional | Fictional | Required. Boolean; exactly true. |
| relationships | Relationships | Required. Array of Object; no unknown keys.; minimum items 0; maximum items 64. |
| relationships[].from | From | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64. |
| relationships[].to | To | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64. |
| relationships[].type | Type | Required. Text; one of "ally", "rival", "neutral". |
| degrees | Degrees | Required. Array of Object; no unknown keys.; minimum items 1; maximum items 12. |
| degrees[].id | Literal identifier used independently of display labels. | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64. |
| degrees[].degree | Degree | Required. Safe integer; minimum 0; maximum 11. |
| components | Components | Required. Safe integer; minimum 1; maximum 12. |
| 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": {
"factions": [
{
"id": "reed",
"name": "Reed Council"
},
{
"id": "tide",
"name": "Tide Guild"
}
],
"pairCount": 1,
"relationshipTypes": [
"ally",
"rival",
"neutral"
],
"reciprocalPolicy": "same",
"connected": true,
"maximumDegree": 1,
"seed": 42
},
"output": {
"fictional": true,
"relationships": [
{
"from": "reed",
"to": "tide",
"type": "rival"
},
{
"from": "tide",
"to": "reed",
"type": "rival"
}
],
"components": 1,
"degrees": [
{
"id": "reed",
"degree": 1
},
{
"id": "tide",
"degree": 1
}
],
"randomness": {
"seed": 42,
"source": "seed"
}
}
}Limitations and assumptions
- Two directed records represent one topological pair. Independent types may still match by chance; labels are fictional rather than claims about real groups or modeled alliance dynamics.
- 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 Language Contact Map Generator
Assign supplied invented languages to regions with minimum coverage quotas, then label caller contact edges; constructed nonuniform allocation, not real sociolinguistic inference.
- Random Fictional Migration Story Map Generator
Construct exact fictional group walks over caller travel links, with optional distinct stops and supplied event hooks; bounded nonuniform path search, no demographic prediction.