Random Fantasy Temple Pilgrimage Map Generator

Description

Construct an exact distinct-temple directed pilgrimage obeying caller visit prerequisites and required destinations, then draw supplied ritual tags; fictional, bounded nonuniform search.

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.

Construct an exact distinct-temple directed pilgrimage obeying caller visit prerequisites and required destinations, then draw supplied ritual tags; fictional, bounded nonuniform search.

When to use this tool

Use this generator to create reproducible fantasy temple pilgrimage 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 temples, travel, prerequisites, start, visitCount, requiredTempleIds 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 steps, route, satisfiedPrerequisites, componentCount, fictional. Use the conventions below. Keep answer-bearing fields separate when presenting an exercise.

Validate acyclic prerequisite links and search a directed travel path without repeated temples. A destination needs every prerequisite already visited; the route must include all required temples. Sample one supplied ritual per stop and return satisfied prerequisite evidence.^[1]

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

Input field	Meaning and units	Accepted input
temples	Temples	Required. Array of Object; no unknown keys.; minimum items 1; maximum items 12.
temples[].id	Literal identifier used independently of display labels.	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
temples[].ritualIds	Ritual Ids	Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 64.; minimum items 1; maximum items 16.
travel	Travel	Required. Array of Object; no unknown keys.; minimum items 0; maximum items 64.
travel[].from	From	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
travel[].to	To	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
prerequisites	Prerequisites	Required. Array of Object; no unknown keys.; minimum items 0; maximum items 64.
prerequisites[].from	From	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
prerequisites[].to	To	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
start	Start	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
visitCount	Visit Count	Required. Safe integer; minimum 1; maximum 12.
requiredTempleIds	Required Temple Ids	Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 64.; minimum items 0; maximum items 12.
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
steps	Steps	Required. Array of Object; no unknown keys.; minimum items 1; maximum items 12.
steps[].number	Number	Required. Safe integer; minimum 1; maximum 12.
steps[].templeId	Temple Id	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
steps[].ritualId	Ritual Id	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
route	Route	Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 64.; minimum items 1; maximum items 12.
satisfiedPrerequisites	Satisfied Prerequisites	Required. Array of Object; no unknown keys.; minimum items 0; maximum items 64.
satisfiedPrerequisites[].from	From	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
satisfiedPrerequisites[].to	To	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
componentCount	Component Count	Required. Safe integer; minimum 1; maximum 1.
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.

json

{
  "input": {
    "temples": [
      {
        "id": "a",
        "ritualIds": [
          "light",
          "bell"
        ]
      },
      {
        "id": "b",
        "ritualIds": [
          "walk"
        ]
      },
      {
        "id": "c",
        "ritualIds": [
          "rest"
        ]
      }
    ],
    "travel": [
      {
        "from": "a",
        "to": "b"
      },
      {
        "from": "a",
        "to": "c"
      },
      {
        "from": "b",
        "to": "c"
      }
    ],
    "prerequisites": [
      {
        "from": "a",
        "to": "b"
      },
      {
        "from": "b",
        "to": "c"
      }
    ],
    "start": "a",
    "visitCount": 3,
    "requiredTempleIds": [
      "c"
    ],
    "seed": 42
  },
  "output": {
    "steps": [
      {
        "number": 1,
        "templeId": "a",
        "ritualId": "bell"
      },
      {
        "number": 2,
        "templeId": "b",
        "ritualId": "walk"
      },
      {
        "number": 3,
        "templeId": "c",
        "ritualId": "rest"
      }
    ],
    "route": [
      "a",
      "b",
      "c"
    ],
    "satisfiedPrerequisites": [
      {
        "from": "a",
        "to": "b"
      },
      {
        "from": "b",
        "to": "c"
      }
    ],
    "componentCount": 1,
    "fictional": true,
    "randomness": {
      "seed": 42,
      "source": "seed"
    }
  }
}

Limitations and assumptions

The start cannot have a prerequisite and visitCount must fit the temple bank. First-feasible search is bounded and not a shortest-route solver; rituals and locations are fictional labels.
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 Fantasy Temple Pilgrimage Map Generator — tool.io
Calculation or validation: graph/topological-sort — tool.io

Similar or alternative tools

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.
Random Fantasy Festival District Plan Generator
Allocate supplied fictional event types to capacity-limited districts with optional occupied-induced-graph connectivity; bounded nonuniform search, not crowd-safety planning.