# The n queens: place n queens on an nxn chessboard so that none of
# them can be eaten in one move.
#
# (C) 1983-2025 Fair Isaac Corporation

import xpress as xp

n = 8  # Size of the chessboard.
N = range(n)

p = xp.problem()

# Create a 2D numpy array of (i,j) variables and link them to problem p.
x = p.addVariables(N, N, vartype=xp.binary, name='q')

vertical = [xp.Sum(x[i, j] for i in N) <= 1 for j in N]
horizontal = [xp.Sum(x[i, j] for j in N) <= 1 for i in N]

diagonal1 = [xp.Sum(x[k-j, j] for j in range(max(0, k-n+1), min(k+1, n))) <= 1
             for k in range(1, 2*n-2)]
diagonal2 = [xp.Sum(x[k+j, j] for j in range(max(0, -k), min(n-k, n))) <= 1
             for k in range(2-n, n-1)]

p.addConstraint(vertical, horizontal, diagonal1, diagonal2)

# What's the largest number of queens we can place on the chessboard?
p.setObjective(xp.Sum(x), sense=xp.maximize)

p.optimize()

xsol = p.getSolution(x)

for i in N:
    for j in N:
        if xsol[i, j] > 0.5:
            print('@', sep='', end='')
        else:
            print('.', sep='', end='')
    print('')