Nqueen problem with python

#Number of queens
print ("Enter the number of queens")
N = int(input())

#chessboard
#NxN matrix with all elements 0
board = [[0]*N for _ in range(N)]

def is_attack(i, j):
    #checking if there is a queen in row or column
    for k in range(0,N):
        if board[i][k]==1 or board[k][j]==1:
            return True
    #checking diagonals
    for k in range(0,N):
        for l in range(0,N):
            if (k+l==i+j) or (k-l==i-j):
                if board[k][l]==1:
                    return True
    return False

def N_queen(n):
    #if n is 0, solution found
    if n==0:
        return True
    for i in range(0,N):
        for j in range(0,N):
            '''checking if we can place a queen here or not
            queen will not be placed if the place is being attacked
            or already occupied'''
            if (not(is_attack(i,j))) and (board[i][j]!=1):
                board[i][j] = 1
                #recursion
                #wether we can put the next queen with this arrangment or not
                if N_queen(n-1)==True:
                    return True
                board[i][j] = 0

    return False

N_queen(N)
for i in board:
    print (i)

Source: codesdope.com

Similar codes

3 votes134 views1 answer
How to convert primitive int to Integer in java
Java
1 vote202 views1 answer
Object to array java
Java
0 vote147 views1 answer
Merge sort algorithm in java short answer
Java
2 votes135 views1 answer
Instantiate optinal java 8
Java
1 vote126 views1 answer
Error inflating class ImageView
Java
1 vote138 views3 answers
Recursion examples Java
Java
0 vote142 views2 answers
Close GUI in jvava
Java
3 votes118 views2 answers
Java sout
Java
5 votes121 views6 answers
Datatables
Java
0 vote141 views1 answer
Convert Octal to Binary in java
Java