Random World Biome Transition Graph Generator

Description

Assign invented biomes to a supplied cell graph with symmetric caller compatibility and required coverage through bounded nonuniform search; illustrative labels, not ecology.

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.

Assign invented biomes to a supplied cell graph with symmetric caller compatibility and required coverage through bounded nonuniform search; illustrative labels, not ecology.

When to use this tool

Use this generator to create reproducible world biome transition graph 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, biomeIds, compatiblePairs, requiredBiomeIds 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, transitions, componentCount, fictional. Use the conventions below and keep answer-bearing fields separate when presenting an exercise.

Assign a supplied biome label to each cell using bounded randomized backtracking. Treat caller compatibility pairs symmetrically on graph edges, prune assignments that cannot cover the still-required biomes, and report each edge’s two labels and overall component count.^[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.
biomeIds	Biome Ids	Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 64.; minimum items 1; maximum items 8.
compatiblePairs	Compatible Pairs	Required. Array of Object; no unknown keys.; minimum items 0; maximum items 36.
compatiblePairs[].from	From	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
compatiblePairs[].to	To	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
requiredBiomeIds	Required Biome 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[].biomeId	Biome Id	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
transitions	Transitions	Required. Array of Object; no unknown keys.; minimum items 0; maximum items 64.
transitions[].from	From	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
transitions[].to	To	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
transitions[].fromBiome	From Biome	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
transitions[].toBiome	To Biome	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 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.

json

{
  "input": {
    "cellIds": [
      "a",
      "b",
      "c"
    ],
    "edges": [
      {
        "from": "a",
        "to": "b"
      },
      {
        "from": "b",
        "to": "c"
      }
    ],
    "biomeIds": [
      "moss",
      "dune"
    ],
    "compatiblePairs": [
      {
        "from": "moss",
        "to": "dune"
      }
    ],
    "requiredBiomeIds": [
      "moss",
      "dune"
    ],
    "seed": 42
  },
  "output": {
    "cells": [
      {
        "id": "a",
        "biomeId": "moss"
      },
      {
        "id": "b",
        "biomeId": "dune"
      },
      {
        "id": "c",
        "biomeId": "moss"
      }
    ],
    "transitions": [
      {
        "from": "a",
        "to": "b",
        "fromBiome": "moss",
        "toBiome": "dune"
      },
      {
        "from": "b",
        "to": "c",
        "fromBiome": "dune",
        "toBiome": "moss"
      }
    ],
    "componentCount": 1,
    "fictional": true,
    "randomness": {
      "seed": 42,
      "source": "seed"
    }
  }
}

Limitations and assumptions

These are invented labels on an explicit graph, not an ecological suitability model. Feasible labelings are not uniformly sampled and required coverage can make the instance infeasible.
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

Tool behavior and example: Random World Biome Transition Graph Generator — tool.io

Similar or alternative tools

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.
Random World Portal Network Generator
Choose an exact fictional directed portal subset with activation solved over location-and-held-flag states. Required destinations are independently reachable, not one tour; bounded nonuniform search.