Python

n-queens-no-q.py

import numpy as np

def canPlace(x2: int, y2: int) -> bool:
    for x in range(x2):
        if result[x] == y2 or abs(x - x2) == abs(result[x] - y2):
            return False;
    return True;

def placeQueens(x: int) -> np.void:
    for X in range(N):
        if canPlace(x, X):
            result[x] = X
            if (x == N - 1):
                print(result)
            placeQueens(x + 1)

N: int = 4;
result: np.ndarray = np.full(N, -1)
placeQueens(0)