by Hajime » Mon Sep 25, 2023 12:31 pm
Nice Ninja. I try to solve it with the least amount of methods (besides basics and no hidden/naked quad): 3 XY-chains !
- Code: Select all
Summary eliminated candidates per Method And per Sudoku
Method \ Sudoku | SER | 1 2 3 4 5 6 7 8 9
|-------|---------------------------------------------------------------
Solved Clue elims | 0 | 115 108 105 106 131 86 78 112 86
Naked Singles | 0.1 | 29 33 28 42 37 19 21 33 41
Hidden Singles | 0.2 | 60 63 68 26 27 83 90 31 31
Naked Single [1] | 2.5 | 0 0 1 5 5 0 0 7 5
Naked Pair [2] | 3 | 7 0 0 0 3 0 9 1 0
Naked Triple [3] | 3.6 | 3 0 13 7 26 0 4 5 9
Hidden Triple [6] | 4 | 0 0 4 0 0 0 0 0 8
Hidden Pair [7] | 3.4 | 0 0 0 0 0 0 0 1 0
Hidden Single [8] | 2.5 | 0 0 0 0 5 0 0 0 0
Pointing/Claiming | 2.8 | 11 27 12 9 52 23 21 21 26
XY-chain [7] | 4.6 | 0 0 0 0 2 0 0 0 0
XY-chain [9] | 5 | 0 2 0 0 2 0 0 0 0
|-------|---------------------------------------------------------------
Eliminated Cand's | 2025 | 225 233 231 195 290 211 223 211 206
Sum(SER * Cand's) |1141.5 | 77.5 101.5 115.3 72.3 301.5 82.9 120.3 110.2 160
Initial Candidates : 2025
Maximum SER rating : 5 <- Approach
Labour rating :1141.5 <- Experimental rating
Time needed : 00:00:04.587
SiSeSuSo Solver and Generator (version 2023-10)