eleven wrote:I think, there is nothing magic with this method.
That was just a way of speaking. The "magic" is, the complexity of the puzzle is reduced (whatever measure of complexity you take: W, SER, ...). And this has to be explained.
eleven wrote:If you mean the complexity of finding the other puzzle, it's like with the other techniques - sometimes easy, sometimes hard, independent of, if it leads to nothing or solves the puzzle directly.
Not exactly. The complexity of a NQ is well defined a priori (whether it leads to any elimination or not and whether it is measured in my system or in SER).
But the complexity of finding the other puzzle is not defined a priori.
eleven wrote:[Added:]If i wanted to program this '2 digits only given in one unit' case, i would replace the givens by the 2 candidates, solve with some techniques, and then for each cell, where only the 2 digits are left as candidates, try one of them. If for one of the cells it's easier to find a solution than for the original (given) cells, the technique makes sense.
No problem with this.
As I remarked previously, this applies to any 2D-cell (i.e. to any bivalue pair of candidates - and of course, trivalue...), not only to the usual units.