Расстановка ферзей

def queens(size):
    field, sols = [[0 for i in range(size)] for j in range(size)], []
    
    def chek_pos(r, c):
        for i in range(r):
            if field[i][c] == 1:
                return False
        for i, j in zip(range(r, -1, -1), range(c, size)):
            if field[i][j] == 1:
                return False        
        for i, j in zip(range(r, -1, -1), range(c, -1, -1)):
            if field[i][j] == 1:
                return False
        return True
    
    def add(r):
        nonlocal sols
        if r == size:
            sol = []
            for r in range(size):
                for c in range(size):
                    if field[r][c] == 1:
                        sol += [(str(c + 1))]
            sols += [(''.join(sol))]
        else:
            for c in range(size):
                if chek_pos(r, c):
                    field[r][c] = 1
                    add(r + 1)
                    field[r][c] = 0
    add(0)
    sols = sorted(list(map(int, sols)))
    for i in sols:
        print(i)

import numpy as np
 
    
def queens(size):
    def under_attack(col, queen):
        return col in queen or any(abs(col - x) == len(queen) - i for i, x in enumerate(queen))
 
    def solve(n):
        ss = [[]]
        for j in range(n):
            ss = [s + [i + 1] for s in ss for i in range(n) if not under_attack(i + 1, s)]
        return ss
  
    for i in np.array(solve(size)):
        np.sort(i)
    for i in np.array(solve(size)):
        print(''.join(map(str, i)))