want to see the same move again else where on that same puzzle?
i don't know why it works but it does.
i still can't prove it neither, so i wrote a page on how to identify and use them. {proff remains buried in massive subnet-forcing chains} which i can't find yet.
closest thing to an explination has something to due with a theory ive been working on for np=n question.
using certificates to reduce/remove issometric solutions by restrictions of information that has greates divergence from the other item in quarry, then identifies issometrics as the same befor calculating.
leaveing singular answers quickly.
http://forum.enjoysudoku.com/viewtopic.php?t=5192
a nonfun read if you can make any sence out of that jumbled mess. it is a math of limits, using constraints of a row to form a "certificate" that creates a single solution by restricing the variable with degree of greatest diversity. basically in this case it takes the 7 and restics its placement with the chain of pairs, and all possible solutions of a row are reduced down to issometric solutions = all the same solution.
- Code: Select all
*-----------------------------------------------------------*
| 2-7 269 8 | 1247 2367 346 | 5 1239 23 |
| 1 3 79 | 8 27 5 | 249 6 24 |
| 4 26 5 | 12 9 36 | 8 123 7 |
|-------------------+-------------------+-------------------|
| 9 4 23 | 6 5 1 | 237 27 8 |
| 8 7 23 | 49 23 49 | 6 5 1 |
| 6 5 1 | 27 8 37 | 234 234 9 |
|-------------------+-------------------+-------------------|
| 37# 8 679 | 5 1 2 | 3479 347 46 |
| 235# 1 67 | 79 4 679 | 23 8 235 |
| 257# 29 4 | 3 67 8 | 1 279 256 |
*-----------------------------------------------------------*
yield chain type 2
conjugated als (35+n) where n = 7
r7c1 {37}
r8c1 (35)
R9c1 (57)
implyes 7 cannot fall outside the row.meaning
r1c1 cannot = 7
