{"id":25603,"date":"2017-10-15T20:20:32","date_gmt":"2017-10-15T14:50:32","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=25603"},"modified":"2017-10-15T20:20:32","modified_gmt":"2017-10-15T14:50:32","slug":"java-programming-backtracking-set-3-n-queen-problem","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/java-programming-backtracking-set-3-n-queen-problem\/","title":{"rendered":"JAVA Programming-Backtracking Set 3 (N Queen Problem)"},"content":{"rendered":"

We have discussed Knight\u2019s tour and Rat in a Maze problems in Set 1 and Set 2 respectively. Let us discuss N Queen as another example problem that can be solved using Backtracking.<\/p>\n

The N Queen is the problem of placing N chess queens on an N\u00d7N chessboard so that no two queens attack each other. For example, following is a solution for 4 Queen problem.<\/p>\n

The expected output is a binary matrix which has 1s for the blocks where queens are placed. For example following is the output matrix for above 4 queen solution.<\/p>\n

              { 0,  1,  0,  0}\r\n              { 0,  0,  0,  1}\r\n              { 1,  0,  0,  0}\r\n              { 0,  0,  1,  0}<\/pre>\n
Naive Algorithm<\/strong>
\nGenerate all possible configurations of queens on board and print a configuration that satisfies the given constraints.<\/p>\n
while there are untried conflagrations\r\n{\r\n   generate the next configuration\r\n   if queens don't attack in this configuration then\r\n   {\r\n      print this configuration;\r\n   }\r\n}<\/pre>\n[ad type=”banner”]\n
Backtracking Algorithm<\/strong>
\nThe idea is to place queens one by one in different columns, starting from the leftmost column. When we place a queen in a column, we check for clashes with already placed queens. In the current column, if we find a row for which there is no clash, we mark this row and column as part of the solution. If we do not find such a row due to clashes then we backtrack and return false.<\/p>\n
1) Start in the leftmost column\r\n2) If all queens are placed\r\n    return true\r\n3) Try all rows in the current column.  Do following for every tried row.\r\n    a) If the queen can be placed safely in this row then mark this [row, \r\n        column] as part of the solution and recursively check if placing  \r\n        queen here leads to a solution.\r\n    b) If placing queen in [row, column] leads to a solution then return \r\n        true.\r\n    c) If placing queen doesn't lead to a solution then umark this [row, \r\n        column] (Backtrack) and go to step (a) to try other rows.\r\n3) If all rows have been tried and nothing worked, return false to trigger \r\n    backtracking.<\/pre>\n
Implementation of Backtracking solution<\/strong><\/p>\n
JAVA Programming<\/strong><\/p>\n
 
 java<\/span> <\/div> 
\/* Java program to solve N Queen Problem using   backtracking *\/public class NQueenProblem{    final int N = 4;     \/* A utility function to print solution *\/    void printSolution(int board[][])    {        for (int i = 0; i < N; i++)        {            for (int j = 0; j < N; j++)                System.out.print(" " + board[i][j]                                 + " ");            System.out.println();        }    }     \/* A utility function to check if a queen can       be placed on board[row][col]. Note that this       function is called when "col" queens are already       placeed in columns from 0 to col -1. So we need       to check only left side for attacking queens *\/    boolean isSafe(int board[][], int row, int col)    {        int i, j;         \/* Check this row on left side *\/        for (i = 0; i < col; i++)            if (board[row][i] == 1)                return false;         \/* Check upper diagonal on left side *\/        for (i=row, j=col; i>=0 && j>=0; i--, j--)            if (board[i][j] == 1)                return false;         \/* Check lower diagonal on left side *\/        for (i=row, j=col; j>=0 && i<N; i++, j--)            if (board[i][j] == 1)                return false;         return true;    }     \/* A recursive utility function to solve N       Queen problem *\/    boolean solveNQUtil(int board[][], int col)    {        \/* base case: If all queens are placed           then return true *\/        if (col >= N)            return true;         \/* Consider this column and try placing           this queen in all rows one by one *\/        for (int i = 0; i < N; i++)        {            \/* Check if queen can be placed on               board[i][col] *\/            if (isSafe(board, i, col))            {                \/* Place this queen in board[i][col] *\/                board[i][col] = 1;                 \/* recur to place rest of the queens *\/                if (solveNQUtil(board, col + 1) == true)                    return true;                 \/* If placing queen in board[i][col]                   doesn't lead to a solution then                   remove queen from board[i][col] *\/                board[i][col] = 0; \/\/ BACKTRACK            }        }         \/* If queen can not be place in any row in           this colum col, then return false *\/        return false;    }     \/* This function solves the N Queen problem using       Backtracking.  It mainly uses  solveNQUtil() to       solve the problem. It returns false if queens       cannot be placed, otherwise return true and       prints placement of queens in the form of 1s.       Please note that there may be more than one       solutions, this function prints one of the       feasible solutions.*\/    boolean solveNQ()    {        int board[][] = {{0, 0, 0, 0},            {0, 0, 0, 0},            {0, 0, 0, 0},            {0, 0, 0, 0}        };         if (solveNQUtil(board, 0) == false)        {            System.out.print("Solution does not exist");            return false;        }         printSolution(board);        return true;    }     \/\/ driver program to test above function    public static void main(String args[])    {        NQueenProblem Queen = new NQueenProblem();        Queen.solveNQ();    }}\/\/ This code is contributed by Abhishek Shankhadhar<\/code><\/pre> <\/div>\n
Output: The 1 values indicate placements of queens<\/strong><\/p>\n
 0  0  1  0 \r\n 1  0  0  0 \r\n 0  0  0  1 \r\n 0  1  0  0<\/pre>\n[ad type=”banner”]\n","protected":false},"excerpt":{"rendered":"
JAVA Programming-Backtracking Set 3 (N Queen Problem) – JAVA – discuss N Queen as another example problem that can be solved using Backtracking.<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[69969,73907,1,2139],"tags":[74485,74505,74484,74518,74499,74498,74504,74515,74480,74506,74517,74495,74520,74521,74511,70502,73908,74160,74486,74164,74492,74493,74514,74162,74519,74483,74513,74488,74481,74491,74510,74508,74487,74482,74489,74502,74496,73910],"class_list":["post-25603","post","type-post","status-publish","format-standard","hentry","category-algorithm","category-backtracking-algorithm","category-coding","category-java","tag-4-queen-problem-using-backtracking","tag-4-queens-problem","tag-4-queens-problem-using-backtracking-algorithm","tag-8-queen-problem-in-artificial-intelligence","tag-8-queen-problem-solution","tag-8-queen-problem-using-backtracking","tag-8-queens","tag-8-queens-on-a-chessboard","tag-8-queens-problem","tag-8-queens-problem-algorithm","tag-8-queens-problem-algorithm-pdf","tag-8-queens-problem-in-c","tag-8-queens-problem-java-code","tag-8-queens-problem-python","tag-8-queens-problem-using-genetic-algorithm-code","tag-backtrack","tag-backtracking-algorithm","tag-backtracking-algorithm-example","tag-backtracking-algorithm-for-8-queen-problem","tag-backtracking-algorithm-pdf","tag-backtracking-definition","tag-backtracking-in-daa","tag-backtracking-method","tag-backtracking-problems","tag-backtracking-python","tag-chess-problems","tag-chess-two-queens","tag-constraint-satisfaction-problem","tag-cryptarithmetic-problem","tag-cryptarithmetic-problem-solved-examples","tag-eight-queens-problem","tag-n-queens","tag-nxn-six","tag-queen-games","tag-queen-in-chess","tag-queens-problem","tag-sum-of-subset-problem-using-backtracking","tag-what-is-backtracking"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/25603","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/comments?post=25603"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/25603\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=25603"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=25603"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=25603"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}