files / problems / hilbert16-degree-8 / compute / q1 / certs / dn_ladder.json

1.2 KB · on GitHub

{
 "what": "Exhaustive two-split moves (drop one and add two, or add two) around every published depth-3 M-collection. Parent dn_sweep.py mode ladder. All 12 depth-3 seeds finished.",
 "depth3_seeds": 12,
 "evals": 204948,
 "distinct_schemes": 29,
 "new": 0,
 "hits_on_open_nests": 0,
 "best_score": 6.0,
 "best_scheme": "<17 u 1<2 u 1<1>>>",
 "complete": true,
 "schemes": [
  "<10 u 1<11>>",
  "<10 u 1<2 u 1<8>>>",
  "<10 u 1<6 u 1<4>>>",
  "<11 u 1<6 u 1<3>>>",
  "<12 u 1<1> u 2<3>>",
  "<12 u 2<1> u 1<5>>",
  "<13 u 1<1> u 1<6>>",
  "<13 u 1<2> u 1<5>>",
  "<13 u 1<3> u 1<4>>",
  "<13 u 1<6 u 1<1>>>",
  "<14 u 1<7>>",
  "<17 u 1<1> u 1<2>>",
  "<17 u 1<2 u 1<1>>>",
  "<5 u 1<10 u 1<5>>>",
  "<5 u 1<14 u 1<1>>>",
  "<5 u 1<1> u 1<14>>",
  "<5 u 1<7> u 1<8>>",
  "<6 u 1<10 u 1<4>>>",
  "<6 u 1<15>>",
  "<6 u 1<6 u 1<8>>>",
  "<7 u 1<10 u 1<3>>>",
  "<8 u 1<1> u 2<5>>",
  "<8 u 2<3> u 1<5>>",
  "<9 u 1<10 u 1<1>>>",
  "<9 u 1<1> u 1<10>>",
  "<9 u 1<3> u 1<8>>",
  "<9 u 1<4> u 1<7>>",
  "<9 u 1<5> u 1<6>>",
  "<9 u 1<6 u 1<5>>>"
 ],
 "open_nests_in_scope": false,
 "note": "The two open (19,3) nests are not a two-split move from any published depth-3 M-collection. Collection-distance at least 3 from that set. Not an obstruction."
}