N-Queens Problem

Place N queens on an NxN board so no two attack each other

Board:
Speed:
Status Ready
Queens Placed 0
Steps 0
Backtracks 0
Solutions Found 0

The N-Queens problem asks: how can N chess queens be placed on an NxN board so that no two queens threaten each other? This visualizer uses backtracking to find solutions, showing each attempt and retreat in real time.