N-Queens
Place N queens on a chessboard so that none attack each other.
N-Queens Visualization
N-Queens • Ultra Premium Backtracking
Cinematic search visualization with synchronized recursion flow
N
Step Count
0
Queens Placed
0/8
Current Action
idle
Search Pressure
Low
Recursion Trace
Live Sync
backtrack(0)
for each column:
if safe -> place queen
recurse to next row
if dead end -> remove queen
Current Probe
Waiting for first search step...
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