n-queens in Fusion

In a nice post on LinkedIn by Alireza Soroudi the author presents a short GAMS integer model for the classical n-queens puzzle: place the maximal number of non-attacking queens on an $n\times n$ chessboard.

We couldn't resist writing it up in Python Fusion as well.

And here is the solution we get for $n=8$:

[[_ ♕ _ _ _ _ _ _]

 [_ _ _ _ _ ♕ _ _]

 [♕ _ _ _ _ _ _ _]

 [_ _ _ _ _ _ ♕ _]

 [_ _ _ ♕ _ _ _ _]

 [_ _ _ _ _ _ _ ♕]

 [_ _ ♕ _ _ _ _ _]

  [_ _ _ _ ♕ _ _ _]]