shye wrote:unsure what youd call it exactly, but i imagine it as a bivalue oddagon on 8 and 9 with grouped links thru b7
guardians 7r1c1 = 7r9c9 => -7r9c1
That's exactly, how i would call it.
Other bivalue oddagons have 2 cells for a node (with a third digit to guarantee the digit change), here it is the empty rectangle for both digits.
(Without the guardians you would always have one of 89 in r78c1 and the other in r9c23 - a 5 digit bivalue oddagon is a remote pair seeing a cell with the 2 digits, here r1c1,r9c9 sees 89 in r1c9)
[Added:]However that step is not needed for a loop eliminating all 3 7's.
To simplify it, replace 89 by xy (whatever which is which), and set r1c9 to x (-> 7y in r1c1 and r9c9).
Then you get
Either 7r1c1 and 7r9c23,
or yr1c1 and r9c23 and 7r9c9 and 7r78c1