Backtracking animated on a chessboard: queens placed row by row, attacked squares pruned, and dead ends visibly undone until a solution appears.
Tip: use samples, upload, copy, download, and send-to actions inside the workspace where available.
N-Queens Visualizer animates backtracking on a chessboard: queens are placed one row at a time, the squares each queen attacks are marked so you can see which columns and diagonals are now closed, and when a row runs out of safe squares the search visibly undoes the last placement and tries the next option. Watching a partial solution get torn back down is the clearest possible explanation of what backtracking actually means.
16-Queens: place one queen per row so none attack. Try each column; on conflict, undo the last move and try the next option — that undo IS backtracking.
place(row):for col in 0..n-1: # prune attackedif safe(row, col): place queenrecurse place(row+1)if stuck: remove queen (backtrack)all rows filled → solution
Place n non-attacking queens: try, recurse, and UNDO on failure. Pruning kills conflicted branches before wasting work.
