| { | |
| "name": "golomb_n9__v2_nh", | |
| "problem_type": "golomb", | |
| "params": { | |
| "n": 9 | |
| }, | |
| "prompt": "Find a Golomb ruler with 9 marks. A Golomb ruler is a set of 9 integers (marks) such that all pairwise distances between marks are unique. The first mark should be at position 0.\n\nReturn a list of 9 integers in increasing order representing the mark positions, or state \"UNSATISFIABLE\" if no solution exists.", | |
| "satisfiable": true, | |
| "solution": { | |
| "x": [ | |
| 0, | |
| 1, | |
| 5, | |
| 12, | |
| 25, | |
| 27, | |
| 35, | |
| 41, | |
| 44 | |
| ] | |
| }, | |
| "difficulty": { | |
| "solve_time_ms": 4578.6, | |
| "search_space": 167619550409708032, | |
| "num_variables": 9, | |
| "num_constraints": 5, | |
| "num_edges": -1, | |
| "backend": "pycsp", | |
| "solve_tier": "hard", | |
| "solve_pct_global": 97.18, | |
| "solve_pct_type": 75.0 | |
| }, | |
| "partial_assignment": null | |
| } | |