stumble wrote:Anyway, what I wanted to know if there was if there was a better aiming point for my XYchains then shooting in the dark the way I'm doing now. Thanks all.
Okay, here's a few suggestions for finding XY-Chains.
1) Choose a starting cell, e.g. [r2c2], and an ending cell, e.g. [r8c8], that have
2-3 candidates between them.
2) If all of the cells they mutually see fail to contain the common candidate, e.g. 6, then return to (1).
3) When possible, see if eliminating the common candidate is (obviously) beneficial before searching for a chain.
4) Now, you need to find a chain of (currently existing) bi-value cells that force the common candidate to be true in either the starting or ending cell. This chain will always start with the non-common candidate being assumed true; e.g. [r2c2]=4 or [r8c8]=8. I don't have any suggestions on how to shortcut finding a chain.
5) Once you find a chain, remember to eliminate the common candidate from
all of the cells the starting cell and ending cell mutually see.
6) Some starting cells work with multiple ending cells. Don't assume that you're done with a starting cell once you find an XY-Chain for it.
7) One XY-Chain may eliminate a candidate in a cell with three candidates. This may allow a subsequent XY-Chain that didn't exist prior to the elimination. Go back and check!
8) Finally, there's no reason that a starting cell can't have a separate XY-Chain for
each candidate. Don't stop after finding an XY-Chain based on one candidate in the starting cell.
- Code: Select all
+-----------------------------------+
| . . . | . . . | . . . |
| . 46 . | . . . | . *** . |
| . . . | . . . | . . . |
|-----------+-----------+-----------|
| . . . | . . . | . . . |
| . . . | . . . | . . . |
| . . . | . . . | . . . |
|-----------+-----------+-----------|
| . . . | . . . | . . . |
| . *** . | . . . | . 68 . |
| . . . | . . . | . . . |
+-----------------------------------+
[
Edited]