{
  "schema": "unitiqx.simworks.reference-solutions.v1",
  "version": "1.0.0",
  "label": "Rule-generated reference, NOT a human or AI tool playthrough.",
  "infrastructure": [
    {
      "id": "water:0",
      "mission": "Supply the eastern districts before the tank empties.",
      "placed_conduits": [
        7,
        14,
        21,
        22,
        30,
        31,
        32,
        25,
        18,
        11
      ],
      "actual_model_coverage": "3/3",
      "budget_used": 10,
      "budget": 18,
      "result": true,
      "source": "Deterministic local algorithm and graph checker; not an observed player or actual infrastructure engineer."
    },
    {
      "id": "water:1",
      "mission": "Route around a construction barrier and preserve sufficient pipe budget.",
      "placed_conduits": [
        7,
        14,
        21,
        28,
        36,
        37,
        38,
        39,
        32,
        25
      ],
      "actual_model_coverage": "3/3",
      "budget_used": 10,
      "budget": 22,
      "result": true,
      "source": "Deterministic local algorithm and graph checker; not an observed player or actual infrastructure engineer."
    },
    {
      "id": "water:2",
      "mission": "Recover all endpoints through a constrained fictional pressure network.",
      "placed_conduits": [
        7,
        14,
        21,
        29,
        30,
        37,
        38,
        39,
        32,
        25
      ],
      "actual_model_coverage": "3/3",
      "budget_used": 10,
      "budget": 25,
      "result": true,
      "source": "Deterministic local algorithm and graph checker; not an observed player or actual infrastructure engineer."
    },
    {
      "id": "power:0",
      "mission": "Reconnect substations to a renewable supply.",
      "placed_conduits": [
        7,
        14,
        21,
        28,
        30,
        31,
        38,
        24,
        25,
        18,
        11
      ],
      "actual_model_coverage": "3/3",
      "budget_used": 11,
      "budget": 18,
      "result": true,
      "source": "Deterministic local algorithm and graph checker; not an observed player or actual infrastructure engineer."
    },
    {
      "id": "power:1",
      "mission": "Bypass disconnected junctions with an efficient wiring plan.",
      "placed_conduits": [
        7,
        14,
        21,
        22,
        23,
        16,
        17,
        18,
        19,
        26,
        33
      ],
      "actual_model_coverage": "3/3",
      "budget_used": 11,
      "budget": 22,
      "result": true,
      "source": "Deterministic local algorithm and graph checker; not an observed player or actual infrastructure engineer."
    },
    {
      "id": "power:2",
      "mission": "Restore virtual power service across a congested critical-path grid.",
      "placed_conduits": [
        7,
        14,
        21,
        22,
        30,
        31,
        32,
        39,
        25,
        18,
        11
      ],
      "actual_model_coverage": "3/3",
      "budget_used": 11,
      "budget": 25,
      "result": true,
      "source": "Deterministic local algorithm and graph checker; not an observed player or actual infrastructure engineer."
    },
    {
      "id": "network:0",
      "mission": "Bring all public edge services back online in an abstract private-free network.",
      "placed_conduits": [
        1,
        8,
        22,
        29,
        30,
        31,
        33,
        34
      ],
      "actual_model_coverage": "3/3",
      "budget_used": 8,
      "budget": 18,
      "result": true,
      "source": "Deterministic local algorithm and graph checker; not an observed player or actual infrastructure engineer."
    },
    {
      "id": "network:1",
      "mission": "Bridge a simulated routing outage while keeping links reachable.",
      "placed_conduits": [
        1,
        2,
        9,
        10,
        7,
        14,
        15,
        22,
        30,
        31
      ],
      "actual_model_coverage": "3/3",
      "budget_used": 10,
      "budget": 22,
      "result": true,
      "source": "Deterministic local algorithm and graph checker; not an observed player or actual infrastructure engineer."
    },
    {
      "id": "network:2",
      "mission": "Create a recoverable toy routing design within a cost envelope.",
      "placed_conduits": [
        7,
        14,
        21,
        1,
        2,
        3,
        4,
        5,
        19,
        26,
        33
      ],
      "actual_model_coverage": "3/3",
      "budget_used": 11,
      "budget": 25,
      "result": true,
      "source": "Deterministic local algorithm and graph checker; not an observed player or actual infrastructure engineer."
    },
    {
      "id": "transit:0",
      "mission": "Connect the origin depot to three disconnected logistics hubs.",
      "placed_conduits": [
        7,
        14,
        1,
        2,
        3,
        4,
        12,
        19,
        26,
        33
      ],
      "actual_model_coverage": "3/3",
      "budget_used": 10,
      "budget": 18,
      "result": true,
      "source": "Deterministic local algorithm and graph checker; not an observed player or actual infrastructure engineer."
    },
    {
      "id": "transit:1",
      "mission": "Build a useful road path without spending on redundant tiles.",
      "placed_conduits": [
        1,
        2,
        3,
        10,
        9,
        16,
        23,
        31,
        32,
        33
      ],
      "actual_model_coverage": "3/3",
      "budget_used": 10,
      "budget": 22,
      "result": true,
      "source": "Deterministic local algorithm and graph checker; not an observed player or actual infrastructure engineer."
    },
    {
      "id": "transit:2",
      "mission": "Restore the fictional region's transit network through detour planning.",
      "placed_conduits": [
        7,
        14,
        15,
        22,
        30,
        37,
        38,
        39,
        33,
        26,
        19,
        12
      ],
      "actual_model_coverage": "3/3",
      "budget_used": 12,
      "budget": 25,
      "result": true,
      "source": "Deterministic local algorithm and graph checker; not an observed player or actual infrastructure engineer."
    }
  ],
  "tactical": [
    {
      "id": "arena:0",
      "moves": [
        {
          "type": "move",
          "dir": "E"
        },
        {
          "type": "fire",
          "dir": "E"
        },
        {
          "type": "fire",
          "dir": "E"
        },
        {
          "type": "move",
          "dir": "E"
        },
        {
          "type": "fire",
          "dir": "W"
        },
        {
          "type": "fire",
          "dir": "W"
        },
        {
          "type": "move",
          "dir": "E"
        },
        {
          "type": "move",
          "dir": "S"
        },
        {
          "type": "move",
          "dir": "S"
        },
        {
          "type": "move",
          "dir": "W"
        },
        {
          "type": "move",
          "dir": "E"
        },
        {
          "type": "move",
          "dir": "E"
        },
        {
          "type": "move",
          "dir": "S"
        },
        {
          "type": "move",
          "dir": "S"
        }
      ],
      "final": {
        "won": true,
        "shields": 8,
        "bots_disabled": 2,
        "steps": 14
      },
      "ai_algorithm": "Bounded best-first search over the disclosed deterministic game state graph.",
      "source": "Rule-based computed solution. The bot AI is shortest-path routing; NO cloud AI model executed."
    },
    {
      "id": "arena:1",
      "moves": [
        {
          "type": "fire",
          "dir": "E"
        },
        {
          "type": "fire",
          "dir": "E"
        },
        {
          "type": "move",
          "dir": "E"
        },
        {
          "type": "move",
          "dir": "E"
        },
        {
          "type": "fire",
          "dir": "S"
        },
        {
          "type": "fire",
          "dir": "S"
        },
        {
          "type": "move",
          "dir": "S"
        },
        {
          "type": "move",
          "dir": "S"
        },
        {
          "type": "move",
          "dir": "W"
        },
        {
          "type": "move",
          "dir": "E"
        },
        {
          "type": "move",
          "dir": "S"
        },
        {
          "type": "move",
          "dir": "S"
        }
      ],
      "final": {
        "won": true,
        "shields": 7,
        "bots_disabled": 2,
        "steps": 12
      },
      "ai_algorithm": "Bounded best-first search over the disclosed deterministic game state graph.",
      "source": "Rule-based computed solution. The bot AI is shortest-path routing; NO cloud AI model executed."
    },
    {
      "id": "arena:2",
      "moves": [
        {
          "type": "fire",
          "dir": "E"
        },
        {
          "type": "fire",
          "dir": "E"
        },
        {
          "type": "fire",
          "dir": "S"
        },
        {
          "type": "fire",
          "dir": "E"
        },
        {
          "type": "fire",
          "dir": "E"
        },
        {
          "type": "fire",
          "dir": "S"
        },
        {
          "type": "move",
          "dir": "E"
        },
        {
          "type": "move",
          "dir": "E"
        },
        {
          "type": "move",
          "dir": "S"
        },
        {
          "type": "move",
          "dir": "E"
        },
        {
          "type": "move",
          "dir": "E"
        },
        {
          "type": "move",
          "dir": "S"
        },
        {
          "type": "move",
          "dir": "S"
        },
        {
          "type": "move",
          "dir": "S"
        }
      ],
      "final": {
        "won": true,
        "shields": 7,
        "bots_disabled": 3,
        "steps": 14
      },
      "ai_algorithm": "Bounded best-first search over the disclosed deterministic game state graph.",
      "source": "Rule-based computed solution. The bot AI is shortest-path routing; NO cloud AI model executed."
    }
  ],
  "racing": [
    {
      "id": "race:0",
      "starting_lane": 1,
      "decisions": "Hold current lane for 65 discrete ticks (artificial test fixture; steering can improve outcomes).",
      "result": {
        "completed": true,
        "shield": 2,
        "collisions": 2,
        "distance": 65
      },
      "source": "Deterministic race engine scenario replay. Not real driving or full browser test."
    },
    {
      "id": "race:1",
      "starting_lane": 1,
      "decisions": "Hold current lane for 90 discrete ticks (artificial test fixture; steering can improve outcomes).",
      "result": {
        "completed": true,
        "shield": 2,
        "collisions": 2,
        "distance": 90
      },
      "source": "Deterministic race engine scenario replay. Not real driving or full browser test."
    },
    {
      "id": "race:2",
      "starting_lane": 0,
      "decisions": "Hold current lane for 115 discrete ticks (artificial test fixture; steering can improve outcomes).",
      "result": {
        "completed": true,
        "shield": 1,
        "collisions": 3,
        "distance": 115
      },
      "source": "Deterministic race engine scenario replay. Not real driving or full browser test."
    }
  ]
}