← MAIN
03 // CONSTRAINT SATISFACTION
SUDOKU CSP
Backtracking · MRV Heuristic · Forward Checking · 400 Puzzles · 100% Accuracy
PUZZLE — CELLS FILLED 0 BACKTRACKS 0 STATUS IDLE
SOLVE PROGRESS 0 / 81
PLAYBACK SPEED 80ms/step
FAST (10ms)SLOW (1000ms)
SOLVER LOG
LOG EVERY
// Solver log will appear here once solving starts
PUZZLE SELECTOR
PUZZLE # (1–400)
PUZZLE PREVIEW
GIVEN — EMPTY —
ALGORITHM
BACKTRACKING CSP
Depth-first search with constraint propagation. Assigns values to cells and backtracks when conflicts are detected.
MRV HEURISTIC
Minimum Remaining Values — always assigns the cell with the fewest legal options first, reducing branching.
FORWARD CHECKING
After each assignment, prunes the domains of all neighbors. Detects dead-ends early before deeper recursion.
PERFORMANCE (400 PUZZLES)
ACCURACY 400 / 400
MEAN RUNTIME 0.0376s
STD DEVIATION 0.0147s
MIN / MAX 0.0052s / 0.0934s
LIVE SOLVE STATS
STEPS TAKEN 0
BACKTRACKS 0
CELLS FILLED 0
CURRENT CELL —