Solving the model

Prerequisites

Get the solution

The resulting output

For better understanding we visualized the output below. A possible solution of the queens problem is:
F8, C7, A6, G5, E4, H3, B2, D1.

By solving the model we generate the following output: 

Performing presolve of the model to compute set of removed variables...
Presolve removed 26 rows and 0 columns
Presolve time: 0.00s
Optimizing the Model...
Optimize a model with 62 rows, 64 columns and 356 nonzeros
Coefficient statistics:
  Matrix range    [1e+00, 1e+00]
  Objective range [1e+00, 1e+00]
  Bounds range    [1e+00, 1e+00]
  RHS range       [1e+00, 1e+00]
Found heuristic solution: objective -8
Presolve removed 26 rows and 0 columns
Presolve time: 0.00s
Presolved: 36 rows, 64 columns, 226 nonzeros
Variable types: 0 continuous, 64 integer (64 binary)

Root relaxation: cutoff, 7 iterations, 0.00 seconds

    Nodes    |    Current Node    |     Objective Bounds      |     Work
 Expl Unexpl |  Obj  Depth IntInf | Incumbent    BestBd   Gap | It/Node Time

     0     0     cutoff    0        -8.00000   -8.99999  12.5%     -    0s

Explored 0 nodes (7 simplex iterations) in 0.17 seconds
Thread count was 4 (of 4 available processors)

Optimal solution found (tolerance 0.00e+00)
Best objective -8.000000000000e+00, best bound -8.000000000000e+00, gap 0.0%
[sum of queens on the board, 8]

Result:
0  0  0  0  0  1  0  0
0  0  1  0  0  0  0  0
1  0  0  0  0  0  0  0
0  0  0  0  0  0  1  0
0  0  0  0  1  0  0  0
0  0  0  0  0  0  0  1
0  1  0  0  0  0  0  0
0  0  0  1  0  0  0  0

Next Step

  • Here you can find even more Models