MathConstraint-Easy / instances /costas_array_n10__v0_nh.json
MathConstraint's picture
Upload folder using huggingface_hub
a9e7957 verified
{
"name": "costas_array_n10__v0_nh",
"problem_type": "costas_array",
"params": {
"n": 10
},
"prompt": "Find a Costas array of order 10: place 10 marks on an 10x10 grid, one per row and one per column, such that all 10*(9)/2 displacement vectors (dr, dc) between pairs of marks (with dc > 0) are pairwise distinct.\n\nReturn x as a list of 10 integers in 0..9, where x[c] is the row of the mark in column c (permutation), or state \"UNSATISFIABLE\" if no such array exists.",
"satisfiable": true,
"solution": {
"x": [
8,
5,
6,
0,
2,
1,
4,
9,
7,
3
]
},
"difficulty": {
"solve_time_ms": 1070.6,
"search_space": 3628800,
"num_variables": 10,
"num_constraints": 11,
"num_edges": -1,
"backend": "pycsp",
"solve_tier": "hard",
"solve_pct_global": 75.75,
"solve_pct_type": 72.22
},
"partial_assignment": null
}