Loading…
Loading…
Places N queens on an N×N board so none share a row, column, or diagonal — trying columns row by row and backtracking on conflict.
Place 6 queens so none attack each other.
1boolean solve(int[] board, int row, int n) {2 if (row == n) return true;3 for (int col = 0; col < n; col++)4 if (isSafe(board, row, col)) {5 board[row] = col;6 if (solve(board, row+1, n)) return true;7 board[row] = -1;8 }9 return false;10}