Explore, fail, undo, retry — N-Queens, Sudoku, and maze solving with visible backtracks.
18 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.
Assigns bounded colors so adjacent vertices never share a color.
Visits every board square exactly once using legal knight moves.
Finds a word along orthogonally adjacent cells without reusing a cell.
Generates every balanced parenthesis string with a fixed number of pairs.
Assigns distinct digits to letters while enforcing addition column by column.
Uses Algorithm X cover/uncover choices to select rows covering every column once.
Fills a rectangular Kakuro run grid with unique digits matching row and column clues.
Evaluates adversarial game trees while pruning bounds that cannot affect the choice.
Extends minimax with expected values at stochastic chance nodes.
Balances exploration and exploitation through UCT-guided simulations.
Performs depth-first searches under successively larger f-cost thresholds.
Propagates game utilities with sound alpha-beta bounds.