MINMAX ARENA
中/EN
P07 · Combinatorial optimization · Proven optimal

Constrained Golomb ruler

Choose k increasing marks with no repeated pairwise difference, obeying required and forbidden marks, while minimizing total length.

Instancek = 6
ObjectiveMinimize ruler length
Requirements
  • Marks increase strictly from 0
  • Every pairwise difference is unique
  • Required and forbidden marks are respected
Challenge this record ↗
CURRENT LEADERLive answer visualization
k = 6
014101217

Every pairwise mark distance is distinct

VERIFIED CONSTRUCTIONlength 17
Current leader

17

ruler length

Record holderFounding benchmark
Solution methodHuman only
Challenge this record ↗
Submission format and technical detailsOpen this when you are ready to prepare a JSON certificate＋

Instance parameters

{
  "k": 6,
  "maxMark": 100,
  "forbidden": [
    2
  ],
  "required": [
    0
  ]
}

Current leader certificate

{
  "marks": [
    0,
    1,
    4,
    10,
    12,
    17
  ]
}

Submit strictly increasing marks beginning with 0. · Verifier v1.0.0