N-Queens

Place N queens on a chessboard so that none attack each other.

N-Queens Visualization

N-Queens Backtracking

5

Complexity

Time Complexity: O(N!)
Space Complexity: O(N)

Pseudocode

function solve(row):
  if row == N: save solution
  for col from 0 to N-1:
    if position (row,col) is safe:
      place queen
      solve(row + 1)
      remove queen

Related Algorithms

Permutations

Generate all possible orderings of a set of elements.

Time: O(N!) | Space: O(N)