Random Dungeon Room Key Generator

Description

Populate a supplied fictional dungeon with contents, clues, and reusable keys placed in reachable rooms, recording unlock stages and required-room paths.

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.

Populate a supplied fictional dungeon with contents, clues, and reusable keys placed in reachable rooms, recording unlock stages and required-room paths.

When to use this tool

Use this generator to create reproducible dungeon room key 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 rooms, doors, keyIds, startRoomId, requiredRoomIds, contents, clues 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, rooms, stages, paths, components. Use the conventions below. Keep answer-bearing fields separate when presenting an exercise.

Validate required-room reachability in the fully unlocked graph. Place each key in a currently reachable room, preferentially selecting keys unlocking a frontier door, and recompute reachability after acquisition. Return stages, room contents, and full-graph paths to required rooms.^[1]

Delegated operations used for this result: shortest unweighted path. Their calculation or parsing conventions apply to the corresponding result fields.^[2]

Input field	Meaning and units	Accepted input
rooms	Rooms	Required. Array of Object; no unknown keys.; minimum items 1; maximum items 24.
rooms[].id	Literal identifier used independently of display labels.	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
rooms[].name	Name	Required. Text; maximum UTF-16 length 2048.
doors	Doors	Required. Array of Object; no unknown keys.; minimum items 0; maximum items 64.
doors[].from	From	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
doors[].to	To	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
doors[].keyId	Key Id	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64. or Null.
keyIds	Key Ids	Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 64.; minimum items 0; maximum items 12.
startRoomId	Start Room Id	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
requiredRoomIds	Required Room Ids	Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 64.; minimum items 0; maximum items 24.
contents	Contents	Required. Array of Text; maximum UTF-16 length 2048.; minimum items 1; maximum items 32.
clues	Clues	Required. Array of Text; maximum UTF-16 length 2048.; minimum items 1; maximum items 32.
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.
rooms	Rooms	Required. Array of Object; no unknown keys.; minimum items 1; maximum items 24.
rooms[].id	Literal identifier used independently of display labels.	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
rooms[].name	Name	Required. Text; maximum UTF-16 length 2048.
rooms[].contents	Contents	Required. Text; maximum UTF-16 length 2048.
rooms[].clue	Clue	Required. Text; maximum UTF-16 length 2048.
rooms[].keys	Keys	Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 64.; minimum items 0; maximum items 12.
stages	Stages	Required. Array of Object; no unknown keys.; minimum items 1; maximum items 13.
stages[].keyId	Key Id	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64. or Null.
stages[].keyRoomId	Key Room Id	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64. or Null.
stages[].reachableRooms	Reachable Rooms	Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 64.; minimum items 1; maximum items 24.
paths	Paths	Required. Array of Object; no unknown keys.; minimum items 0; maximum items 24.
paths[].target	Target	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
paths[].distance	Distance	Required. Safe integer; minimum 0; maximum 23.
paths[].rooms	Rooms	Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 64.; minimum items 1; maximum items 24.
components	Components	Required. Safe integer; minimum 1; maximum 24.
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": {
    "rooms": [
      {
        "id": "foyer",
        "name": "Entry Hall"
      },
      {
        "id": "vault",
        "name": "Lantern Vault"
      },
      {
        "id": "gallery",
        "name": "Map Gallery"
      }
    ],
    "doors": [
      {
        "from": "foyer",
        "to": "vault",
        "keyId": "brass"
      },
      {
        "from": "foyer",
        "to": "gallery",
        "keyId": null
      }
    ],
    "keyIds": [
      "brass"
    ],
    "startRoomId": "foyer",
    "requiredRoomIds": [
      "vault"
    ],
    "contents": [
      "Stacked crates",
      "Stone benches"
    ],
    "clues": [
      "A cold draft",
      "Chalk marks"
    ],
    "seed": 42
  },
  "output": {
    "fictional": true,
    "rooms": [
      {
        "id": "foyer",
        "name": "Entry Hall",
        "contents": "Stone benches",
        "clue": "Chalk marks",
        "keys": [
          "brass"
        ]
      },
      {
        "id": "vault",
        "name": "Lantern Vault",
        "contents": "Stacked crates",
        "clue": "Chalk marks",
        "keys": []
      },
      {
        "id": "gallery",
        "name": "Map Gallery",
        "contents": "Stacked crates",
        "clue": "Chalk marks",
        "keys": []
      }
    ],
    "stages": [
      {
        "keyId": null,
        "keyRoomId": null,
        "reachableRooms": [
          "foyer",
          "gallery"
        ]
      },
      {
        "keyId": "brass",
        "keyRoomId": "foyer",
        "reachableRooms": [
          "foyer",
          "gallery",
          "vault"
        ]
      }
    ],
    "paths": [
      {
        "target": "vault",
        "distance": 1,
        "rooms": [
          "foyer",
          "vault"
        ]
      }
    ],
    "components": 1,
    "randomness": {
      "seed": 42,
      "source": "seed"
    }
  }
}

Limitations and assumptions

Paths are final unlocked shortest paths, not necessarily the acquisition walk. Keys may share rooms and unused keys can be placed. This is fictional puzzle structure rather than real building access or escape safety.
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 Dungeon Room Key Generator — tool.io
Calculation or validation: graph/shortest-unweighted-path — tool.io

Similar or alternative tools

Random Fantasy Fortress Room Hierarchy Generator
Construct a rooted fictional room tree with caller role transitions, cross-zone gateway roles and child/depth caps while preserving access tags; bounded nonuniform search, no security certification.
Random Fantasy Border Checkpoint Plan Generator
Place fictional checkpoints on cross-realm caller links and expand supplied permission templates; exact sampling without replacement, not immigration or enforcement advice.