Tukukkk

def isSafe (board, row, col):

    # check left row

    for y in range(col):

        if board[row][y] == 1:

            return False

    # check diagonal left top

    for x, y in zip(range(row, -1, -1), range(col, -1, -1)):

        if board[x][y] == 1:

            return False

    # check diagonal left bottom

    for x, y in zip(range(row, N, 1), range(col, -1, -1)):

        if board[x][y] == 1:

            return False



    return True



def generateSolution(board, col):

    # terminating condition

    # all columns covered

    global N

    if col >= N:

        return True

    # loop over all the rows

    for i in range(N):

        if isSafe(board, i, col) == True:

            board[i][col] = 1

            # recursively place other queens

            if generateSolution(board, col + 1) == True:

                return True

            # unmark queen spot

            board[i][col] = 0

    # backtrack

    return False





N = int(input())

startCol = 0

board = [[0 for i in range(N)] for j in range(N)]

# print(board)



if generateSolution(board, startCol) == False:

    print("No Solution Exists")

else:

    print("Solution exists")

    print(board)

def isSafe (board, row, col):

    # check left row

    for y in range(col):

        if board[row][y] == 1:

            return False

    # check diagonal left top

    for x, y in zip(range(row, -1, -1), range(col, -1, -1)):

        if board[x][y] == 1:

            return False

    # check diagonal left bottom

    for x, y in zip(range(row, N, 1), range(col, -1, -1)):

        if board[x][y] == 1:

            return False



    return True



def generateSolution(board, col):

    # terminating condition

    # all columns covered

    global N

    if col >= N:

        return True

    # loop over all the rows

    for i in range(N):

        if isSafe(board, i, col) == True:

            board[i][col] = 1

            # recursively place other queens

            if generateSolution(board, col + 1) == True:

                return True

            # unmark queen spot

            board[i][col] = 0

    # backtrack

    return False





N = int(input())

startCol = 0

board = [[0 for i in range(N)] for j in range(N)]

# print(board)



if generateSolution(board, startCol) == False:

    print("No Solution Exists")

else:

    print("Solution exists")

    print(board)

def isSafe (board, row, col):

    # check left row

    for y in range(col):

        if board[row][y] == 1:

            return False

    # check diagonal left top

    for x, y in zip(range(row, -1, -1), range(col, -1, -1)):

        if board[x][y] == 1:

            return False

    # check diagonal left bottom

    for x, y in zip(range(row, N, 1), range(col, -1, -1)):

        if board[x][y] == 1:

            return False



    return True



def generateSolution(board, col):

    # terminating condition

    # all columns covered

    global N

    if col >= N:

        return True

    # loop over all the rows

    for i in range(N):

        if isSafe(board, i, col) == True:

            board[i][col] = 1

            # recursively place other queens

            if generateSolution(board, col + 1) == True:

                return True

            # unmark queen spot

            board[i][col] = 0

    # backtrack

    return False





N = int(input())

startCol = 0

board = [[0 for i in range(N)] for j in range(N)]

# print(board)



if generateSolution(board, startCol) == False:

    print("No Solution Exists")

else:

    print("Solution exists")

    print(board)

def isSafe (board, row, col):

    # check left row

    for y in range(col):

        if board[row][y] == 1:

            return False

    # check diagonal left top

    for x, y in zip(range(row, -1, -1), range(col, -1, -1)):

        if board[x][y] == 1:

            return False

    # check diagonal left bottom

    for x, y in zip(range(row, N, 1), range(col, -1, -1)):

        if board[x][y] == 1:

            return False



    return True



def generateSolution(board, col):

    # terminating condition

    # all columns covered

    global N

    if col >= N:

        return True

    # loop over all the rows

    for i in range(N):

        if isSafe(board, i, col) == True:

            board[i][col] = 1

            # recursively place other queens

            if generateSolution(board, col + 1) == True:

                return True

            # unmark queen spot

            board[i][col] = 0

    # backtrack

    return False





N = int(input())

startCol = 0

board = [[0 for i in range(N)] for j in range(N)]

# print(board)



if generateSolution(board, startCol) == False:

    print("No Solution Exists")

else:

    print("Solution exists")

    print(board)

Your Answer

StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["\$", "\$"]]);
});
});
}, "mathjax-editing");

StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "196"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});