Continuing with the series of min-expands, as I find interesting cases.
I'm still busy analysing mith's 63,137 database.
(At the same time, I'm testing my ORk-chain rules on this large database, and improving their merging with the previously existing rules, before I publish any update to CSP-Rules).
Puzzles in this database can have very different behaviours wrt the anti-tridagon vs "normal" chain rules: for each kind of rules, a puzzle may require only easy vs very hard ones, and this for each of the two kinds independently. And the hard "normal" chain rules may have to be before and/or in between and/or after the tridagon chain rules. The positive side of it, it makes the tridagon and "normal" chain rules naturally blend in the same global framework. In particular, the "simplest-first" strategy works in exactly the same way with the Tridagon rules.
As I find puzzles with different behaviours, I propose them here.
This puzzle is much easier than the previous #19828.
- Code: Select all
+-------+-------+-------+
! . . . ! . 5 6 ! 7 . 9 !
! 4 . . ! 1 8 9 ! . . . !
! . . . ! 3 . . ! . . . !
+-------+-------+-------+
! 2 . 4 ! . . 5 ! 6 9 . !
! . . 5 ! . . . ! . 7 4 !
! . . . ! . . . ! 5 . 2 !
+-------+-------+-------+
! 5 . . ! . 6 . ! 9 2 . !
! 6 . 9 ! 5 2 . ! 4 . 7 !
! . 4 2 ! . . . ! . . . !
+-------+-------+-------+
....567.94..189......3.....2.4..569...5....74......5.25...6.92.6.952.4.7.42......;7164;135727
SER = 10.9