Sem 4 & Sem 7 (AOAD & RAI) : N queen Algorithm Java Code

import java.util.*; class nqueen { static int n=10; static int board[]=new int[n]; static boolean place(int row,int column) { for(int i=1;i<=row-1;++i) { if(column==board[i]) return false; else if(abs(column-board[i])==abs(row-i)) return false; } return true; } static int abs(int arg) { if(arg<0) return arg*-1; else if(arg==0) return 0; else return arg; } static void queen(int row,int n) { for(int column=1;column<=n;++column) { if(place(row,column)) { board[row]=column; if(row==n) display(); else queen(row+1,n); } } } static void display() { System.out.println(); System.out.print("Pattern "); for(int i=1;i<=n;++i) System.out.print(" "+board[i]); System.out.println(); int pos; System.out.print(" "); for(int i=1;i<=n;++i) System.out.print(" "+i); System.out.println(); for(int i=1;i<=n;++i) { pos=board[i]; System.out.print(" "+i); for(int j=1;j<=n;++j) { if(j==pos) System.out.print(" Q"); else System.out.print(" -"); } System.out.println(); } } public static void main(String args[]) { Scanner scr=new Scanner(System.in); System.out.println("**********N Queen problem*************"); System.out.println("Enter the number of queens"); n=scr.nextInt(); /* IF there are 'n' queens there are n rows and n columns */ queen(1,n); } }

VIEW OUR SPECIAL PAGE FOR SEM 7 STUDENTS -  sem 7 java codes