files / problems / hilbert16-degree-8 / compute / q2 / certs / ladder3.json

1.4 KB · on GitHub

{
  "what": "Three-split moves (drop at most one, add three compatible splits) around the five published (19,3) M-collections. Next distance after the q1 one-split neighbourhood of all 38 and the two-split ladder around the twelve depth-3 M-collections.",
  "which": "193",
  "seeds": 5,
  "evals": 2719977,
  "distinct_schemes": 30,
  "new": 0,
  "hits_on_open_nests": 0,
  "best_score": 6.0,
  "best_scheme": "<17 u 1<2 u 1<1>>>",
  "complete": false,
  "seconds": 11165.2,
  "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>>",
    "<16 u 3<1>>",
    "<17 u 1<1> u 1<2>>",
    "<17 u 1<2 u 1<1>>>",
    "<18 u 1<3>>",
    "<5 u 1<10 u 1<5>>>",
    "<5 u 1<14 u 1<1>>>",
    "<5 u 1<1> u 1<14>>",
    "<5 u 1<2> u 1<13>>",
    "<6 u 1<15>>",
    "<8 u 1<1> u 2<5>>",
    "<8 u 2<1> u 1<9>>",
    "<8 u 2<3> u 1<5>>",
    "<9 u 1<10 u 1<1>>>",
    "<9 u 1<1> u 1<10>>",
    "<9 u 1<2> u 1<9>>",
    "<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": "Residue. The 10,800-second cap was hit during the last seed <18 u 1<3>>. First four seeds finished. Neither open nest. Not a lower bound."
}