.
- Code: Select all
Resolution state after Singles and whips[1]:
+----------------+----------------+----------------+
! 3 79 2 ! 8 167 4 ! 1679 69 5 !
! 5 1 4 ! 2 9 67 ! 67 3 8 !
! 6 79 8 ! 37 5 137 ! 4 2 19 !
+----------------+----------------+----------------+
! 48 468 9 ! 346 2 36 ! 5 1 7 !
! 147 3 16 ! 4567 8 5679 ! 2 469 69 !
! 247 246 5 ! 1 67 679 ! 8 469 3 !
+----------------+----------------+----------------+
! 14 456 3 ! 567 167 2 ! 169 8 169 !
! 9 568 16 ! 56 4 1568 ! 3 7 2 !
! 128 268 7 ! 9 3 168 ! 16 5 4 !
+----------------+----------------+----------------+
===> There are 16 W1-anti-backdoors:
n9r1c8 n6r4c2 n4r4c4 n1r5c1 n6r5c3 n4r5c8 n9r5c9 n7r6c1 n2r6c2 n6r6c5 n6r6c8 n9r7c7 n6r7c9 n1r8c3 n2r9c1 n1r9c7
10 of which give rise to a solution with whips[≤7]
The simplest is:
- Code: Select all
z-chain[4]: r5n1{c3 c1} - c1n7{r5 r6} - r6c5{n7 n6} - b6n6{r6c8 .} ==> r5c3 ≠ 6
stte
[Edit, after being asked by a non-posting reader] The means for obtaining such results with CSP-Rules is by choosing some set of rules in the configuration file, with a maximum length for chains, e.g.
- Code: Select all
(defglobal ?*all-chains-max-length* = 8)
(bind ?*Bivalue-Chains* TRUE)
(bind ?*Whips* TRUE)
; (bind ?*G-Whips* TRUE)
(bind ?*z-Chains* TRUE)
(bind ?*Typed-Bivalue-Chains* TRUE)
(bind ?*Typed-z-Chains* TRUE)
(bind ?*Typed-Whips* TRUE)
; (bind ?*Oddagons* TRUE)
and then typing the command:
- Code: Select all
(find-sudoku-1-steppers-wrt-resolution-theory W1
"..2..4..5.1..9..386...5......9.2..17.3..8.2....51..8....3..2...9...4..7...79...54")
For this puzzle, the total computation time for all the 1-step solutions is 16s.
Details about this recent feature of SudoRules are available in the Basic User Manual on
https://github.com/denis-berthier/CSP-Rules-V2.1Make sure you have a recent update of CSP-Rules.