Explore, fail, undo, retry — N-Queens, Sudoku, and maze solving with visible backtracks.
6 visualizations
Places N queens on an N×N board so none attack each other, backtracking whenever a conflict arises.
Finds a path through a grid maze from the top-left to the bottom-right using recursive backtracking.
Generates every ordering of a set by placing each unused element at the next position and backtracking.
Decides whether any subset of numbers adds up to a target, exploring include/exclude choices with pruning.
Generates every k-element subset of n items using a start-index that only moves forward, so each combination is produced exactly once.
Fills the first empty cell with each candidate digit 1–9 that doesn't violate row/column/box rules, recursing and backtracking on dead ends.