........1.....2..3.45..........45....6...7...8......2....8..7...7....5..9..1..... but now at
6..7.4.517..562.43.45.18.67....456785642871398.76.14254.685.7.2.7842.5.6952176384
- Code: Select all
+-------------------------+-------------------------+-------------------------+
| 6 28 39 | 7 39 4 | 28 5 1 |
| 7 189 19 | 5 6 2 | 89 4 3 |
| 23 4 5 | 39 1 8 | 29 6 7 |
+-------------------------+-------------------------+-------------------------+
| 123 1239 139 | 39 4 5 | 6 7 8 |
| 5 6 4 | 2 8 7 | 1 3 9 |
| 8 39 7 | 6 39 1 | 4 2 5 |
+-------------------------+-------------------------+-------------------------+
| 4 13 6 | 8 5 39 | 7 19 2 |
| 13 7 8 | 4 2 39 | 5 19 6 |
| 9 5 2 | 1 7 6 | 3 8 4 |
+-------------------------+-------------------------+-------------------------+
There may be other paths, but I was solving by P&P and was interested in what was happening with the (39) Remote Pair chain r6c25 – r43c4 – r1c53
The Rule (as I understand it) is that if you label the cells along the chain alternately A – B – A –B etc. (and it can branch) then any other cell which can see an A and a B from the connected network cannot be either of the paired candidates in the chain. The same rule can be used in Simple Colouring.
What I found interesting was that if you work right through the chain as I’ve written it, you find that r6c2 is an A and r1c3 is a B, which would indicate that r4c3 can be solved for 1. However, r4c3 also sees r4c4 which is an A in the chain. I wondered at the time if this would counter the RP deletions, but decided it didn’t, and 1r4c3 certainly solved the puzzle in singles. It seems the Remote Pairs and Simple Colouring methods are immune to non-eliminating connections when there are effective eliminating connections.
The other point is that this RP solution of r4c3 to 1 could not occur earlier before I had reduced r1c3 to (39) only.