Hi Robert,

The document I attempted to translate is:

I had trouble understanding the non-simplified English version document as it started out rather cryptically with notation I was unfamiliar with. But the simplified version is a good introduction.

Here is a very high level summary of what I think you are saying (please correct me if I'm wrong):

1. Choose a candidate (A) from a bi-value cell or conjugate pair.

2. Assume A is true, and color it blue.

3. Look over the board for candidates that are forced to be true due to the blue candidate(s) being true. Color these blue as well.

4. Repeat step 3 using the new blue candidates until no more are found or a contradiction is discovered.

5. Choose the candidate that pairs with A (e.g. the other candidate of the bi-value cell that A lives in) call this B.

6. Assume that B is true, and color it yellow.

7. Look over the board for candidates that are forced to be true due to the yellow candidate(s) being true. Color these yellow as well.

8. Repeat step 7 using the new yellow candidates until no more are found or a contradiction is discovered.

9. If a track would result in a contradiction, the initial assumption is false. e.g. if A results in a contradiction, A is false and can be eliminated, which makes B true, along with all yellow candidates!

Assuming no contradiction was found:

10. Any uncolored candidate that sees its match in both blue and yellow can be eliminated.

11. Any candidate colored both blue and yellow is the solution for its cell!

Repeat, starting with step 1 (and a new pair) until the puzzle is solved.