Easy example:
- Code: Select all
#1/WX/B4,JSB
...4.2...8.......1..2...9............8.....7............8...3..1.......6...2.9...
122211333122211444122211444555666444555666333777666333777889998777889998555889998
Analyze log:
- Code: Select all
Eliminated candidates per Method and per Sudoku
Method \ Sudoku | SER | 1
|-------|------
Not counted elims | 0 | 125
Naked Singles | 0.1 | 35
Hidden Singles | 0.2 | 108
Naked Single [1] | 2.5 | 9
Naked Pair [2] | 3 | 13
Naked Triple [3] | 3.6 | 8
Naked Quad [4] | 5 | 11
Hidden Quad [5] | 5.4 | 16
Hidden Triple [6] | 4 | 8
Hidden Pair [7] | 3.4 | 1
|-------|------
Eliminated Cand's | 334 | 334
Sum(SER * Cand's) | 292.2 | 292.2
Initial Candidates : 334
Maximum SER rating : 5.4 <- Approach
Labour rating : 292.2 <- Experimental rating
Time needed : 00:00:00.832
SiSeSuSo Solver and Generator (version 2021-04b)
Filling an empty grid with 9 clues (example row 1) isn't enough to have a unique solution. What will be the minimal number of clues to have a unique solution?