| 1 | # This is an example of the N-Queens problem, which is a classic combinatorial problem. |
| 2 | # The problem is to place N queens on an N x N chessboard so that no two queens attack each other. |
| 3 | # |
| 4 | # We show how to model the problem as a MIP and solve it using highspy. |
nothing calls this directly
no test coverage detected