{
  "domain": "computer-science",
  "image": "python:3.12-slim",
  "data": "Six point sets in the unit square, generated by score.py from fixed seeds.",
  "benchmark": {
    "task": "Travelling salesman",
    "metric": {
      "name": "tour length vs nearest neighbour",
      "better": "lower"
    },
    "cost": "seconds",
    "subtasks": "point sets",
    "aggregate": "mean",
    "baseline": {
      "name": "Nearest neighbour",
      "score": 1,
      "cost": 0.5,
      "subtasks": {
        "n40-1": 1,
        "n40-2": 1,
        "n80-3": 1,
        "n80-4": 1,
        "n160-5": 1,
        "n160-6": 1
      }
    },
    "guardrails": [
      "The tour visits every point exactly once",
      "At most 30 seconds for all six point sets",
      "solve.py sees only the points, in its own process"
    ]
  },
  "checks": {
    "score": {
      "path": "checks/score.sbatch",
      "metrics": "metrics.json"
    }
  }
}