.
In SudoRules, Singles backdoors are easily found:
- load SudoRules with only backdoors selected, i.e. in section 3e of the config file, set:
(bind ?*Backdoors* TRUE)
- init SudoRules with the puzzle:
(init "1.......2.3..2..4...25.63....76.58......7......92.86....59.37...7..5..9.9.......8")
- ask for the backdoors:
(find-backdoors)
SudoRules finds two BRT backdoors:
n9r1c5 n8r1c2
Now, you can also look for backdoors wrt to any set of rules (with the confluence property)
SudoRules finds:
- 3 W1-backdoors:
n8r8c3 n9r1c5 n8r1c2
- 37 S4-backdoors:
n5r9c8 n1r9c7 n4r9c6 n3r9c3 n3r8c9 n1r8c4 n8r8c3 n6r8c1 n6r7c9 n8r7c5 n1r7c2 n4r7c1 n1r6c5 n5r6c2 n3r6c1 n5r5c9 n3r5c8 n9r5c6 n4r5c4 n1r5c3 n6r5c2 n8r5c1 n9r4c9 n3r4c5 n1r3c9 n4r3c5 n7r3c1 n7r2c9 n9r2c7 n1r2c6 n8r2c4 n5r2c1 n5r1c7 n9r1c5 n3r1c4 n4r1c3 n8r1c2
As for the question, how easy is it to find them, it's as easy or as difficult as finding an anti-backdoor: you have to try all the candidates one by one. Whether a candidate leads to some result or not is totally dependent on the puzzle and there's no way to know before trying it.
I don't know if backdoors are reviled, but using them corresponds to guessing (which has indeed always been reviled) - while using an anti-backdoor corresponds to using T&E.
For the present puzzle, as already shown by previous solutions, backdoors are quite useless.
- Code: Select all
Resolution state after Singles and whips[1]:
+----------------------+----------------------+----------------------+
! 1 45689 468 ! 3478 3489 479 ! 59 5678 2 !
! 5678 3 68 ! 178 2 179 ! 159 4 15679 !
! 478 489 2 ! 5 1489 6 ! 3 178 179 !
+----------------------+----------------------+----------------------+
! 234 124 7 ! 6 1349 5 ! 8 123 1349 !
! 234568 124568 13468 ! 134 7 149 ! 12459 1235 13459 !
! 345 145 9 ! 2 134 8 ! 6 1357 13457 !
+----------------------+----------------------+----------------------+
! 2468 12468 5 ! 9 1468 3 ! 7 126 146 !
! 23468 7 13468 ! 148 5 124 ! 124 9 1346 !
! 9 1246 1346 ! 147 146 1247 ! 1245 12356 8 !
+----------------------+----------------------+----------------------+
202 candidates.
biv-chain[3]: r2c3{n8 n6} - b3n6{r2c9 r1c8} - b3n8{r1c8 r3c8} ==> r3c1≠8, r3c2≠8
jellyfish-in-columns: n4{c3 c7 c4 c6}{r9 r8 r5 r1} ==> r9c5≠4, r9c2≠4, r8c9≠4, r8c1≠4, r5c9≠4, r5c2≠4, r5c1≠4, r1c5≠4, r1c2≠4
jellyfish-in-columns: n1{c3 c7 c4 c6}{r9 r8 r5 r2} ==> r9c8≠1, r9c5≠1, r9c2≠1, r8c9≠1, r5c9≠1, r5c8≠1, r5c2≠1, r2c9≠1
singles ==> r9c5=6, r9c2=2, r7c8=2, r5c7=2, r4c1=2, r1c8=6, r3c8=8, r6c8=7, r4c8=1, r4c2=4, r3c2=9, r6c9=4, r8c6=2
whip[1]: r6n5{c2 .} ==> r5c1≠5, r5c2≠5
whip[1]: r1n7{c6 .} ==> r2c4≠7, r2c6≠7
whip[1]: b6n9{r5c9 .} ==> r2c9≠9
biv-chain[3]: b2n7{r1c6 r1c4} - c4n3{r1 r5} - r5n4{c4 c6} ==> r1c6≠4
biv-chain[3]: r1n4{c3 c4} - c5n4{r3 r7} - c5n8{r7 r1} ==> r1c3≠8
stte