Constraint solver
Bitmask constraint propagation with minimum-remaining-value backtracking — solves any valid 9×9 puzzle, from a single clue to one square short of done.
Loading example…