{"abstract":"A passage listed both ways is reported as a loop.","category":"Procedural level generation constraints","checks":8,"contract":"Cells (x, y) with 0 <= x < w, 0 <= y < h. First pass over passages [[x1, y1], [x2, y2]]: out-of-bounds or non-orthogonally-adjacent pairs -> 'invalid-edge'; the same passage twice in either orientation -> 'duplicate'. Then union passages in order: joining already connected cells -> 'loop'. Finally 'perfect' if all cells are connected, else 'disconnected'.","contract_signature":"w, h, passages","evaluation_group":"w2-procedural-level-generation-constraints-perfect-maze","failed_approach":"Sorting flattened coordinates makes different passages collide.","family":"w2-procedural-level-generation-constraints-perfect-maze-duplicate-key","id":"FA-86626","implementations":{"attempt":{"sha256":"638953ec1e36659c2771a86402e87c59d8944370d0a3c06e21fa66f7436cb70d","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(w, h, passages):\n    seen = set()\n    parent = {(x, y): (x, y) for x in range(w) for y in range(h)}\n    def find(p):\n        while parent[p] != p:\n            parent[p] = parent[parent[p]]\n            p = parent[p]\n        return p\n    for (x1, y1), (x2, y2) in passages:\n        if not (0 <= x1 < w and 0 <= y1 < h and 0 <= x2 < w and 0 <= y2 < h):\n            return 'invalid-edge'\n        if abs(x1 - x2) + abs(y1 - y2) != 1:\n            return 'invalid-edge'\n        key = tuple(sorted([x1, y1, x2, y2]))\n        if key in seen:\n            return 'duplicate'\n        seen.add(key)\n    for (x1, y1), (x2, y2) in passages:\n        a, b = find((x1, y1)), find((x2, y2))\n        if a == b:\n            return 'loop'\n        parent[a] = b\n    roots = {find(p) for p in parent}\n    return 'perfect' if len(roots) == 1 else 'disconnected'\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncases = [[('reversed duplicate #1', [2, 1, [[[0, 0], [1, 0]], [[1, 0], [0, 0]]]], 'duplicate'),\n  ('fault site duplicate key #1',\n   [4, 1, [[[2, 0], [1, 0]], [[3, 0], [2, 0]], [[0, 0], [1, 0]], [[1, 0], [0, 0]]]],\n   'duplicate'),\n  ('fault site duplicate key #2',\n   [3, 1, [[[1, 0], [0, 0]], [[0, 0], [1, 0]], [[1, 0], [2, 0]]]],\n   'duplicate'),\n  ('partial repair boundary #1',\n   [4,\n    3,\n    [[[1, 0], [1, 1]],\n     [[0, 1], [0, 0]],\n     [[0, 1], [0, 2]],\n     [[2, 0], [2, 1]],\n     [[1, 0], [0, 0]],\n     [[1, 0], [2, 0]],\n     [[2, 1], [2, 2]],\n     [[2, 2], [3, 2]],\n     [[2, 1], [3, 1]],\n     [[2, 2], [1, 2]],\n     [[1, 1], [0, 1]],\n     [[0, 2], [1, 2]]]],\n   'loop'),\n  ('partial repair boundary #2',\n   [3,\n    3,\n    [[[1, 2], [0, 2]],\n     [[1, 0], [2, 0]],\n     [[0, 0], [0, 1]],\n     [[1, 1], [1, 0]],\n     [[2, 1], [2, 0]],\n     [[1, 1], [2, 1]],\n     [[0, 2], [0, 2]]]],\n   'invalid-edge'),\n  ('diagonal passage #1', [2, 2, [[[0, 0], [1, 1]]]], 'invalid-edge'),\n  ('single cell maze #1', [1, 1, []], 'perfect'),\n  ('control #1',\n   [3, 2, [[[2, 1], [1, 1]], [[0, 1], [0, 0]], [[1, 1], [2, 2]], [[0, 0], [1, 0]]]],\n   'invalid-edge')],\n [('reversed duplicate #1', [2, 1, [[[0, 0], [1, 0]], [[1, 0], [0, 0]]]], 'duplicate'),\n  ('fault site duplicate key #1',\n   [3, 1, [[[1, 0], [0, 0]], [[0, 0], [1, 0]], [[1, 0], [2, 0]]]],\n   'duplicate'),\n  ('fault site duplicate key #2',\n   [3,\n    4,\n    [[[1, 3], [2, 3]],\n     [[0, 2], [1, 2]],\n     [[2, 1], [2, 0]],\n     [[1, 0], [2, 0]],\n     [[2, 2], [2, 1]],\n     [[0, 2], [0, 1]],\n     [[0, 1], [1, 1]],\n     [[1, 2], [1, 1]],\n     [[1, 2], [2, 2]],\n     [[2, 1], [2, 2]],\n     [[1, 1], [1, 0]]]],\n   'duplicate'),\n  ('partial repair boundary #1',\n   [3,\n    3,\n    [[[2, 1], [2, 0]],\n     [[2, 0], [1, 0]],\n     [[0, 1], [0, 0]],\n     [[0, 1], [1, 1]],\n     [[1, 0], [1, 1]],\n     [[0, 0], [1, 0]],\n     [[0, 1], [0, 2]]]],\n   'loop'),\n  ('partial repair boundary #2',\n   [3, 2, [[[2, 1], [2, 0]], [[0, 1], [1, 1]], [[1, 0], [0, 0]], [[1, 1], [1, 0]]]],\n   'disconnected'),\n  ('diagonal passage #1', [2, 2, [[[0, 0], [1, 1]]]], 'invalid-edge'),\n  ('single cell maze #1', [1, 1, []], 'perfect'),\n  ('control #1',\n   [3, 2, [[[2, 1], [1, 1]], [[0, 1], [0, 0]], [[1, 1], [2, 2]], [[0, 0], [1, 0]]]],\n   'invalid-edge')],\n [('reversed duplicate #1', [2, 1, [[[0, 0], [1, 0]], [[1, 0], [0, 0]]]], 'duplicate'),\n  ('fault site duplicate key #1',\n   [2,\n    3,\n    [[[0, 0], [1, 0]],\n     [[1, 0], [0, 0]],\n     [[1, 2], [1, 1]],\n     [[0, 1], [0, 1]],\n     [[1, 0], [1, 1]],\n     [[0, 1], [1, 1]],\n     [[0, 1], [0, 2]],\n     [[0, 2], [1, 2]]]],\n   'duplicate'),\n  ('fault site duplicate key #2',\n   [3, 1, [[[1, 0], [2, 0]], [[0, 0], [1, 0]], [[1, 0], [0, 0]]]],\n   'duplicate'),\n  ('partial repair boundary #1',\n   [4,\n    2,\n    [[[1, 0], [0, 0]],\n     [[1, 0], [1, 1]],\n     [[3, 0], [2, 0]],\n     [[2, 1], [3, 1]],\n     [[2, 1], [2, 0]],\n     [[1, 1], [2, 1]],\n     [[1, 1], [0, 1]],\n     [[3, 1], [3, 0]]]],\n   'loop'),\n  ('partial repair boundary #2',\n   [4,\n    4,\n    [[[0, 0], [1, 0]],\n     [[0, 2], [0, 1]],\n     [[2, 3], [2, 2]],\n     [[2, 0], [3, 0]],\n     [[1, 2], [2, 2]],\n     [[3, 1], [3, 0]],\n     [[3, 2], [2, 2]],\n     [[2, 1], [2, 0]],\n     [[3, 2], [3, 3]],\n     [[1, 1], [0, 1]],\n     [[1, 2], [1, 1]],\n     [[0, 2], [1, 2]],\n     [[3, 1], [3, 2]]]],\n   'loop'),\n  ('diagonal passage #1', [2, 2, [[[0, 0], [1, 1]]]], 'invalid-edge'),\n  ('single cell maze #1', [1, 1, []], 'perfect'),\n  ('control #1',\n   [3, 2, [[[2, 1], [1, 1]], [[0, 1], [0, 0]], [[1, 1], [2, 2]], [[0, 0], [1, 0]]]],\n   'invalid-edge')],\n [('reversed duplicate #1', [2, 1, [[[0, 0], [1, 0]], [[1, 0], [0, 0]]]], 'duplicate'),\n  ('fault site duplicate key #1',\n   [4, 2, [[[1, 1], [1, 0]], [[2, 0], [2, 1]], [[2, 1], [1, 1]], [[2, 1], [2, 0]], [[0, 0], [0, 1]]]],\n   'duplicate'),\n  ('fault site duplicate key #2',\n   [3,\n    2,\n    [[[2, 1], [2, 0]],\n     [[2, 0], [2, 1]],\n     [[0, 0], [0, 1]],\n     [[0, 0], [1, 0]],\n     [[1, 1], [2, 1]],\n     [[1, 0], [2, 0]],\n     [[1, 0], [1, 1]]]],\n   'duplicate'),\n  ('partial repair boundary #1',\n   [4,\n    4,\n    [[[0, 0], [0, 1]],\n     [[2, 0], [3, 0]],\n     [[0, 2], [0, 1]],\n     [[1, 0], [2, 0]],\n     [[2, 1], [3, 1]],\n     [[1, 3], [2, 3]],\n     [[3, 3], [3, 2]],\n     [[0, 2], [0, 3]],\n     [[2, 1], [1, 1]],\n     [[2, 2], [2, 1]],\n     [[1, 3], [0, 3]],\n     [[1, 1], [1, 2]],\n     [[2, 0], [2, 1]],\n     [[2, 2], [2, 3]],\n     [[2, 3], [3, 3]],\n     [[1, 2], [2, 2]]]],\n   'loop'),\n  ('partial repair boundary #2',\n   [3, 2, [[[0, 1], [0, 0]], [[1, 1], [2, 1]], [[1, 1], [0, 1]], [[1, 0], [1, 1]], [[2, 1], [2, 0]]]],\n   'perfect'),\n  ('diagonal passage #1', [2, 2, [[[0, 0], [1, 1]]]], 'invalid-edge'),\n  ('single cell maze #1', [1, 1, []], 'perfect'),\n  ('control #1', [4, 1, [[[2, 0], [2, 0]], [[1, 0], [0, 0]], [[2, 0], [1, 0]]]], 'invalid-edge')],\n [('reversed duplicate #1', [2, 1, [[[0, 0], [1, 0]], [[1, 0], [0, 0]]]], 'duplicate'),\n  ('fault site duplicate key #1',\n   [1, 4, [[[0, 2], [0, 3]], [[0, 0], [0, 1]], [[0, 3], [0, 2]]]],\n   'duplicate'),\n  ('fault site duplicate key #2',\n   [1, 4, [[[0, 3], [0, 2]], [[0, 1], [0, 2]], [[0, 2], [0, 3]], [[0, 0], [0, 1]]]],\n   'duplicate'),\n  ('partial repair boundary #1',\n   [2,\n    4,\n    [[[1, 2], [1, 1]],\n     [[1, 0], [0, 0]],\n     [[1, 1], [0, 1]],\n     [[0, 1], [0, 2]],\n     [[1, 0], [1, 1]],\n     [[0, 2], [1, 2]]]],\n   'loop'),\n  ('partial repair boundary #2', [2, 2, [[[1, 1], [0, 1]], [[1, 0], [1, 1]], [[0, 0], [0, 1]]]], 'perfect'),\n  ('diagonal passage #1', [2, 2, [[[0, 0], [1, 1]]]], 'invalid-edge'),\n  ('single cell maze #1', [1, 1, []], 'perfect'),\n  ('control #1',\n   [3,\n    3,\n    [[[1, 0], [1, 0]],\n     [[1, 0], [2, 0]],\n     [[0, 2], [0, 1]],\n     [[2, 2], [2, 1]],\n     [[0, 2], [1, 2]],\n     [[1, 0], [0, 0]],\n     [[0, 1], [1, 1]]]],\n   'invalid-edge')]]\nfor label, args, expected in cases[N-1]:\n    check(label, solve(*args), expected)\nprint(json.dumps({\"observations\": observations, \"passed\": all(x[\"passed\"] for x in observations)}, ensure_ascii=False))\nraise SystemExit(0 if all(x[\"passed\"] for x in observations) else 1)\n"},"broken":{"sha256":"345245dc80a13b269211b3fc1a12c0fc472da8df94a609e3b0795cf1476059ca","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(w, h, passages):\n    seen = set()\n    parent = {(x, y): (x, y) for x in range(w) for y in range(h)}\n    def find(p):\n        while parent[p] != p:\n            parent[p] = parent[parent[p]]\n            p = parent[p]\n        return p\n    for (x1, y1), (x2, y2) in passages:\n        if not (0 <= x1 < w and 0 <= y1 < h and 0 <= x2 < w and 0 <= y2 < h):\n            return 'invalid-edge'\n        if abs(x1 - x2) + abs(y1 - y2) != 1:\n            return 'invalid-edge'\n        key = ((x1, y1), (x2, y2))\n        if key in seen:\n            return 'duplicate'\n        seen.add(key)\n    for (x1, y1), (x2, y2) in passages:\n        a, b = find((x1, y1)), find((x2, y2))\n        if a == b:\n            return 'loop'\n        parent[a] = b\n    roots = {find(p) for p in parent}\n    return 'perfect' if len(roots) == 1 else 'disconnected'\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncases = [[('reversed duplicate #1', [2, 1, [[[0, 0], [1, 0]], [[1, 0], [0, 0]]]], 'duplicate'),\n  ('fault site duplicate key #1',\n   [4, 1, [[[2, 0], [1, 0]], [[3, 0], [2, 0]], [[0, 0], [1, 0]], [[1, 0], [0, 0]]]],\n   'duplicate'),\n  ('fault site duplicate key #2',\n   [3, 1, [[[1, 0], [0, 0]], [[0, 0], [1, 0]], [[1, 0], [2, 0]]]],\n   'duplicate'),\n  ('partial repair boundary #1',\n   [4,\n    3,\n    [[[1, 0], [1, 1]],\n     [[0, 1], [0, 0]],\n     [[0, 1], [0, 2]],\n     [[2, 0], [2, 1]],\n     [[1, 0], [0, 0]],\n     [[1, 0], [2, 0]],\n     [[2, 1], [2, 2]],\n     [[2, 2], [3, 2]],\n     [[2, 1], [3, 1]],\n     [[2, 2], [1, 2]],\n     [[1, 1], [0, 1]],\n     [[0, 2], [1, 2]]]],\n   'loop'),\n  ('partial repair boundary #2',\n   [3,\n    3,\n    [[[1, 2], [0, 2]],\n     [[1, 0], [2, 0]],\n     [[0, 0], [0, 1]],\n     [[1, 1], [1, 0]],\n     [[2, 1], [2, 0]],\n     [[1, 1], [2, 1]],\n     [[0, 2], [0, 2]]]],\n   'invalid-edge'),\n  ('diagonal passage #1', [2, 2, [[[0, 0], [1, 1]]]], 'invalid-edge'),\n  ('single cell maze #1', [1, 1, []], 'perfect'),\n  ('control #1',\n   [3, 2, [[[2, 1], [1, 1]], [[0, 1], [0, 0]], [[1, 1], [2, 2]], [[0, 0], [1, 0]]]],\n   'invalid-edge')],\n [('reversed duplicate #1', [2, 1, [[[0, 0], [1, 0]], [[1, 0], [0, 0]]]], 'duplicate'),\n  ('fault site duplicate key #1',\n   [3, 1, [[[1, 0], [0, 0]], [[0, 0], [1, 0]], [[1, 0], [2, 0]]]],\n   'duplicate'),\n  ('fault site duplicate key #2',\n   [3,\n    4,\n    [[[1, 3], [2, 3]],\n     [[0, 2], [1, 2]],\n     [[2, 1], [2, 0]],\n     [[1, 0], [2, 0]],\n     [[2, 2], [2, 1]],\n     [[0, 2], [0, 1]],\n     [[0, 1], [1, 1]],\n     [[1, 2], [1, 1]],\n     [[1, 2], [2, 2]],\n     [[2, 1], [2, 2]],\n     [[1, 1], [1, 0]]]],\n   'duplicate'),\n  ('partial repair boundary #1',\n   [3,\n    3,\n    [[[2, 1], [2, 0]],\n     [[2, 0], [1, 0]],\n     [[0, 1], [0, 0]],\n     [[0, 1], [1, 1]],\n     [[1, 0], [1, 1]],\n     [[0, 0], [1, 0]],\n     [[0, 1], [0, 2]]]],\n   'loop'),\n  ('partial repair boundary #2',\n   [3, 2, [[[2, 1], [2, 0]], [[0, 1], [1, 1]], [[1, 0], [0, 0]], [[1, 1], [1, 0]]]],\n   'disconnected'),\n  ('diagonal passage #1', [2, 2, [[[0, 0], [1, 1]]]], 'invalid-edge'),\n  ('single cell maze #1', [1, 1, []], 'perfect'),\n  ('control #1',\n   [3, 2, [[[2, 1], [1, 1]], [[0, 1], [0, 0]], [[1, 1], [2, 2]], [[0, 0], [1, 0]]]],\n   'invalid-edge')],\n [('reversed duplicate #1', [2, 1, [[[0, 0], [1, 0]], [[1, 0], [0, 0]]]], 'duplicate'),\n  ('fault site duplicate key #1',\n   [2,\n    3,\n    [[[0, 0], [1, 0]],\n     [[1, 0], [0, 0]],\n     [[1, 2], [1, 1]],\n     [[0, 1], [0, 1]],\n     [[1, 0], [1, 1]],\n     [[0, 1], [1, 1]],\n     [[0, 1], [0, 2]],\n     [[0, 2], [1, 2]]]],\n   'duplicate'),\n  ('fault site duplicate key #2',\n   [3, 1, [[[1, 0], [2, 0]], [[0, 0], [1, 0]], [[1, 0], [0, 0]]]],\n   'duplicate'),\n  ('partial repair boundary #1',\n   [4,\n    2,\n    [[[1, 0], [0, 0]],\n     [[1, 0], [1, 1]],\n     [[3, 0], [2, 0]],\n     [[2, 1], [3, 1]],\n     [[2, 1], [2, 0]],\n     [[1, 1], [2, 1]],\n     [[1, 1], [0, 1]],\n     [[3, 1], [3, 0]]]],\n   'loop'),\n  ('partial repair boundary #2',\n   [4,\n    4,\n    [[[0, 0], [1, 0]],\n     [[0, 2], [0, 1]],\n     [[2, 3], [2, 2]],\n     [[2, 0], [3, 0]],\n     [[1, 2], [2, 2]],\n     [[3, 1], [3, 0]],\n     [[3, 2], [2, 2]],\n     [[2, 1], [2, 0]],\n     [[3, 2], [3, 3]],\n     [[1, 1], [0, 1]],\n     [[1, 2], [1, 1]],\n     [[0, 2], [1, 2]],\n     [[3, 1], [3, 2]]]],\n   'loop'),\n  ('diagonal passage #1', [2, 2, [[[0, 0], [1, 1]]]], 'invalid-edge'),\n  ('single cell maze #1', [1, 1, []], 'perfect'),\n  ('control #1',\n   [3, 2, [[[2, 1], [1, 1]], [[0, 1], [0, 0]], [[1, 1], [2, 2]], [[0, 0], [1, 0]]]],\n   'invalid-edge')],\n [('reversed duplicate #1', [2, 1, [[[0, 0], [1, 0]], [[1, 0], [0, 0]]]], 'duplicate'),\n  ('fault site duplicate key #1',\n   [4, 2, [[[1, 1], [1, 0]], [[2, 0], [2, 1]], [[2, 1], [1, 1]], [[2, 1], [2, 0]], [[0, 0], [0, 1]]]],\n   'duplicate'),\n  ('fault site duplicate key #2',\n   [3,\n    2,\n    [[[2, 1], [2, 0]],\n     [[2, 0], [2, 1]],\n     [[0, 0], [0, 1]],\n     [[0, 0], [1, 0]],\n     [[1, 1], [2, 1]],\n     [[1, 0], [2, 0]],\n     [[1, 0], [1, 1]]]],\n   'duplicate'),\n  ('partial repair boundary #1',\n   [4,\n    4,\n    [[[0, 0], [0, 1]],\n     [[2, 0], [3, 0]],\n     [[0, 2], [0, 1]],\n     [[1, 0], [2, 0]],\n     [[2, 1], [3, 1]],\n     [[1, 3], [2, 3]],\n     [[3, 3], [3, 2]],\n     [[0, 2], [0, 3]],\n     [[2, 1], [1, 1]],\n     [[2, 2], [2, 1]],\n     [[1, 3], [0, 3]],\n     [[1, 1], [1, 2]],\n     [[2, 0], [2, 1]],\n     [[2, 2], [2, 3]],\n     [[2, 3], [3, 3]],\n     [[1, 2], [2, 2]]]],\n   'loop'),\n  ('partial repair boundary #2',\n   [3, 2, [[[0, 1], [0, 0]], [[1, 1], [2, 1]], [[1, 1], [0, 1]], [[1, 0], [1, 1]], [[2, 1], [2, 0]]]],\n   'perfect'),\n  ('diagonal passage #1', [2, 2, [[[0, 0], [1, 1]]]], 'invalid-edge'),\n  ('single cell maze #1', [1, 1, []], 'perfect'),\n  ('control #1', [4, 1, [[[2, 0], [2, 0]], [[1, 0], [0, 0]], [[2, 0], [1, 0]]]], 'invalid-edge')],\n [('reversed duplicate #1', [2, 1, [[[0, 0], [1, 0]], [[1, 0], [0, 0]]]], 'duplicate'),\n  ('fault site duplicate key #1',\n   [1, 4, [[[0, 2], [0, 3]], [[0, 0], [0, 1]], [[0, 3], [0, 2]]]],\n   'duplicate'),\n  ('fault site duplicate key #2',\n   [1, 4, [[[0, 3], [0, 2]], [[0, 1], [0, 2]], [[0, 2], [0, 3]], [[0, 0], [0, 1]]]],\n   'duplicate'),\n  ('partial repair boundary #1',\n   [2,\n    4,\n    [[[1, 2], [1, 1]],\n     [[1, 0], [0, 0]],\n     [[1, 1], [0, 1]],\n     [[0, 1], [0, 2]],\n     [[1, 0], [1, 1]],\n     [[0, 2], [1, 2]]]],\n   'loop'),\n  ('partial repair boundary #2', [2, 2, [[[1, 1], [0, 1]], [[1, 0], [1, 1]], [[0, 0], [0, 1]]]], 'perfect'),\n  ('diagonal passage #1', [2, 2, [[[0, 0], [1, 1]]]], 'invalid-edge'),\n  ('single cell maze #1', [1, 1, []], 'perfect'),\n  ('control #1',\n   [3,\n    3,\n    [[[1, 0], [1, 0]],\n     [[1, 0], [2, 0]],\n     [[0, 2], [0, 1]],\n     [[2, 2], [2, 1]],\n     [[0, 2], [1, 2]],\n     [[1, 0], [0, 0]],\n     [[0, 1], [1, 1]]]],\n   'invalid-edge')]]\nfor label, args, expected in cases[N-1]:\n    check(label, solve(*args), expected)\nprint(json.dumps({\"observations\": observations, \"passed\": all(x[\"passed\"] for x in observations)}, ensure_ascii=False))\nraise SystemExit(0 if all(x[\"passed\"] for x in observations) else 1)\n"}},"limitations":"Deterministic toy contract stipulated for this model; integer or exact arithmetic only, not a reproduction of any specific game engine. This reproducer isolates one failure mechanism. Results cover the supplied fixtures. Variants within a family share a test contract and should remain grouped when constructing evaluation splits. Related mechanisms with a shared evaluation_group must also remain together; these controlled models are not independent production incidents.","method":"Deterministic executable model with adversarial boundary fixtures.","provenance":{"created_by":"Failure Map","dependencies":"Python standard library","family":"w2-procedural-level-generation-constraints-perfect-maze-duplicate-key","generated_at":"2026-09-29T14:50:51.281461+00:00","license":"CC0-1.0","python":"3.12.14","seed":1,"split":"open-access"},"relevance":"Procedural generators silently emit unplayable or unfair levels when a single constraint check uses the wrong boundary, axis, neighborhood or update order; the defect is visible in exact generated geometry.","root_cause":"The duplicate key keeps orientation.","sha256":"16f76642af7b8bd7a71f9093f7d789e0b2be9a703aad358b06fcd15c790ce056","title":"Perfect maze validator: Reversed duplicate passages are missed · case 01","variant":1,"variant_policy":"Five numbered records share a model and may reuse boundary fixtures.","verified":true,"visibility":"public","verification":{"attempt":{"elapsed_ms":41.07,"exit_code":1,"observations":[{"actual":"duplicate","check":"reversed duplicate #1","expected":"duplicate","passed":true},{"actual":"duplicate","check":"fault site duplicate key #1","expected":"duplicate","passed":true},{"actual":"duplicate","check":"fault site duplicate key #2","expected":"duplicate","passed":true},{"actual":"duplicate","check":"partial repair boundary #1","expected":"loop","passed":false},{"actual":"duplicate","check":"partial repair boundary #2","expected":"invalid-edge","passed":false},{"actual":"invalid-edge","check":"diagonal passage #1","expected":"invalid-edge","passed":true},{"actual":"perfect","check":"single cell maze #1","expected":"perfect","passed":true},{"actual":"invalid-edge","check":"control #1","expected":"invalid-edge","passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"reversed duplicate #1\", \"actual\": \"duplicate\", \"expected\": \"duplicate\", \"passed\": true}, {\"check\": \"fault site duplicate key #1\", \"actual\": \"duplicate\", \"expected\": \"duplicate\", \"passed\": true}, {\"check\": \"fault site duplicate key #2\", \"actual\": \"duplicate\", \"expected\": \"duplicate\", \"passed\": true}, {\"check\": \"partial repair boundary #1\", \"actual\": \"duplicate\", \"expected\": \"loop\", \"passed\": false}, {\"check\": \"partial repair boundary #2\", \"actual\": \"duplicate\", \"expected\": \"invalid-edge\", \"passed\": false}, {\"check\": \"diagonal passage #1\", \"actual\": \"invalid-edge\", \"expected\": \"invalid-edge\", \"passed\": true}, {\"check\": \"single cell maze #1\", \"actual\": \"perfect\", \"expected\": \"perfect\", \"passed\": true}, {\"check\": \"control #1\", \"actual\": \"invalid-edge\", \"expected\": \"invalid-edge\", \"passed\": true}], \"passed\": false}\n"},"broken":{"elapsed_ms":41.417,"exit_code":1,"observations":[{"actual":"loop","check":"reversed duplicate #1","expected":"duplicate","passed":false},{"actual":"loop","check":"fault site duplicate key #1","expected":"duplicate","passed":false},{"actual":"loop","check":"fault site duplicate key #2","expected":"duplicate","passed":false},{"actual":"loop","check":"partial repair boundary #1","expected":"loop","passed":true},{"actual":"invalid-edge","check":"partial repair boundary #2","expected":"invalid-edge","passed":true},{"actual":"invalid-edge","check":"diagonal passage #1","expected":"invalid-edge","passed":true},{"actual":"perfect","check":"single cell maze #1","expected":"perfect","passed":true},{"actual":"invalid-edge","check":"control #1","expected":"invalid-edge","passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"reversed duplicate #1\", \"actual\": \"loop\", \"expected\": \"duplicate\", \"passed\": false}, {\"check\": \"fault site duplicate key #1\", \"actual\": \"loop\", \"expected\": \"duplicate\", \"passed\": false}, {\"check\": \"fault site duplicate key #2\", \"actual\": \"loop\", \"expected\": \"duplicate\", \"passed\": false}, {\"check\": \"partial repair boundary #1\", \"actual\": \"loop\", \"expected\": \"loop\", \"passed\": true}, {\"check\": \"partial repair boundary #2\", \"actual\": \"invalid-edge\", \"expected\": \"invalid-edge\", \"passed\": true}, {\"check\": \"diagonal passage #1\", \"actual\": \"invalid-edge\", \"expected\": \"invalid-edge\", \"passed\": true}, {\"check\": \"single cell maze #1\", \"actual\": \"perfect\", \"expected\": \"perfect\", \"passed\": true}, {\"check\": \"control #1\", \"actual\": \"invalid-edge\", \"expected\": \"invalid-edge\", \"passed\": true}], \"passed\": false}\n"}},"member_only":{"stages":["fixed"],"fields":["implementations.fixed","verification.fixed","harness","repair"],"note":"The verified repair, its recorded checks, the repair description, and the scoring harness are available to members."}}