Skip to content

Coloring ​

Coloring is a way to reason through connections between conjugate pairs. The term also refers to a family of solving techniques.

When the board contains a connected set of strong links (between conjugate pairs throughout this page), we can color the cells at the ends of each link with two opposite colors, A and B, dividing the nodes into two groups.

Two-color coloring

In the diagram above, suppose every solid line represents a strong link between a conjugate pair for digit x found on the board. Each end is a simple node such as [C:x]. By giving the two ends of each link opposite colors, we divide all the nodes into groups A and B. Let a, b, d, f, and i belong to group A, and c, e, g, and h belong to group B.

Let us follow the reasoning:

  • If a is false, its strong link with c makes c true.
  • The nodes of a conjugate pair represent the same candidate in two cells that see each other, so they also form a weak link. The weak links from c to b and d therefore make both b and d false.
  • The strong links from d to g and h make both g and h true.
  • The weak links from g to f and i (using the conjugate pairs as weak links) make both f and i false. The weak link between i and the already true h is consistent with this result.
  • The strong link from f to e makes e true.

The nodes provisionally determined to be false are a, b, d, f, and i: exactly all the nodes in group A. Those provisionally determined to be true are c, e, g, and h: exactly all the nodes in group B.

Conversely, if a is true, the same reasoning shows that all the nodes in group A are true and all those in group B are false.

This way of dividing a connected set of conjugate pairs into two colors, A and B, is called Simple Coloring. The reasoning above gives us its properties:

  • Nodes of the same color have the same truth value: all the nodes in group A are either true together or false together. The same holds for group B.
  • Nodes of opposite colors have opposite truth values: if group A is true, group B is false; if group A is false, group B is true.

Any node in group A therefore has a logical strong link with any node in group B: at least one of the two must be true.

These properties lead to useful coloring techniques.

Simple Coloring ​

Simple Coloring (Trap) ​

Recall the elimination logic using strong and weak links: a node that sees both ends of a strong link must be false.

Candidate elimination using strong and weak links

As explained above, after applying Simple Coloring with colors A and B to a connected set of conjugate pairs for the same candidate x, the nodes represented by A and B have a logical strong link A━B.

Any other node that sees nodes of both colors must therefore be false. Since all the nodes here are simple nodes of the form [C:x], we can eliminate x from any other cell that sees cells of both colors.

Simple Coloring (Trap)

This technique uses Simple Coloring to eliminate candidates from cells outside the colored node set. It is called Simple Coloring (Trap).

Simple Coloring (Wrap) ​

What happens if, after applying Simple Coloring, we find two nodes of the same color that see each other (form a weak link)?

Simple Coloring (Wrap)

A weak link prevents its two ends from both being true. But one property of Simple Coloring is that nodes of the same color have the same truth value: either all are true or all are false. The only possibility is therefore that the entire color group is false.

Another property of Simple Coloring is that opposite colors have opposite truth values. We can therefore also determine that the entire other color group is true!

Thus, if two nodes of one color see each other, we can eliminate x from every cell of that color and place x in every cell of the opposite color.

This technique uses Simple Coloring to directly determine truth values within the colored node set. It is called Simple Coloring (Wrap).

Multi-Coloring ​

For the same candidate x, suppose the board contains two sets of strong links, each connected internally but not connected to the other by strong links. We can color them with two pairs of colors (four colors in total), then use the relationships between the two colorings to eliminate candidates or place digits.

Multi-Coloring (Trap) ​

After applying Simple Coloring to one set of strong links, let its two color groups be A and B. Either A is true and B is false, or A is false and B is true, giving the logical strong link A━B. Similarly, coloring another set with colors C and D gives a second strong link C━D. Now suppose a node of one color in the first set sees a node of one color in the second set, for example giving the weak link B┉C. We then have a logical alternating inference chain, A━B┉C━D. It follows that we can eliminate x from cells that see nodes of both colors A and D.

Multi-Coloring (Trap)

This technique uses two Simple Colorings to form a logical AIC and eliminate candidates from other cells outside the colored node sets. It is called Multi-Coloring (Trap).

Multi-Coloring (Wrap) ​

Suppose nodes of one color in one Simple Coloring see nodes of both colors in another Simple Coloring. These connections need not come from the same node; different nodes of that color may provide them. For example, let group B in coloring AB see both colors in coloring CD. By the properties of Simple Coloring, at least one of C and D is true. Whichever is true makes a node in B that sees it false. Since nodes of the same color have the same truth value, the entire group B is false and the entire group A is true.

Multi-Coloring (Wrap)

This technique uses one of two Simple Colorings to determine the truth value of an entire color group within the other coloring. It is called Multi-Coloring (Wrap).

Remote Pairs ​

Recall the Naked Pair technique: when two bivalue cells containing the same candidate pair {x, y} lie in the same house (row, column, or box), they see each other. No other cell in that house can contain x or y, so any such candidates can be eliminated.

After applying the Naked Pair eliminations, the two {x, y} bivalue cells are the only remaining positions for either digit in that house. They therefore form two “parallel” conjugate pairs, one for x and one for y. We can apply Simple Coloring to these bivalue cells and use Simple Coloring (Trap).

Remote Pairs

From any other cell that sees cells of both colors, we can eliminate both candidates x and y.

This technique applies Simple Coloring to bivalue cells containing the same candidate pair to produce eliminations. It is called Remote Pairs.