N-Queens Problemi (Geri İzleme Algoritması)

1function solveNQueens(n: number): number[][] {
2  const solutions: number[][] = [];
3  const board: number[] = Array(n).fill(-1);
4
5  function isSafe(row: number, col: number): boolean {
6    for (let i = 0; i < row; i++) {
7      if (board[i] === col || Math.abs(i - row) === Math.abs(board[i] - col)) return false;
8    }
9    return true;
10  }
11
12  function backtrack(row: number): void {
13    if (row === n) {
14      solutions.push([...board]);
15      return;
16    }
17    for (let col = 0; col < n; col++) {
18      if (isSafe(row, col)) {
19        board[row] = col;
20        backtrack(row + 1);
21        board[row] = -1;
22      }
23    }
24  }
25
26  backtrack(0);
27  return solutions;
28}