by expanding the bivalve cell from a size 1 als =>
into an als consisting of N cells holding N+1 digits we can move this technique up to higher power.
simplistic examples: as this technique as an als has way to many examples to nail them all down
formations for the 1 & 3 strong links featured in S-wing thread remains the same.
the eliminations process is a bit more technical:
the linking digits that are visible to the als must see all copies of that digit in the als.
then the eliminations remain the same:
end points of 1 <> 3,
and end points of 3 <> 1
- Code: Select all
+-------------+--------------+---------+
| . . . | . (1234) . | . . . |
| . . . | . (1234) . | . . . |
| . . . | . (1234) . | . . . |
+-------------+--------------+---------+
| . . . | . . . | . . . |
| . -3(1) . | . (1) . | . . . |
| . . . | . . . | . . . |
+-------------+--------------+---------+
| . . . | . . . | . . . |
| . -1(3) . | . (3) . | . . . |
| . . . | . . . | . . . |
+-------------+--------------+---------+
this post is created for my own endeavors in programing it into my solver:
