Source: https://mayphus.org/sudoku/
Title: Sudoku
Metadata: {"kind":"artifact","language":"en","route":"/sudoku/","type":"page"}

Sudoku

The recovered Racket implementation represents a nine-by-nine board, computes the legal candidates for an empty cell, and searches for a solution by choosing the empty cell with the fewest candidates. A second search can enumerate solutions up to a requested limit.

On 7 October 2026, all nine assertions in the archived solver test passed. For the included easy puzzle, the first row starts as “5 3 0 0 7 0 0 0 0”, with zero representing an empty cell. The third cell admits 1, 2 or 4; 5 is rejected. The solver reproduces the stored complete solution, whose first row is “5 3 4 6 7 8 9 1 2”. Searching with a limit of two finds only one solution for that fixture.

This verifies the recovered example and its tested operations. It does not establish the correctness of every puzzle, a puzzle generator, or the archived web interface.