What Does the Not Equal Sign Mean in Pips?

What does the not equal sign mean in pips? That no two pip values inside that region may match. The badge is written ≠, and it is the single most misread rule in the format — because almost everyone reads it as a statement about dominoes when it is a statement about numbers, and the difference decides boards.

By Sukie · Puzzle editor

Published September 4, 2025 · Updated September 12, 2026

The misreading

Here is the trap. Your tray holds distinct dominoes — a 2-5, a 3-3, a 0-6 and so on, no duplicates. So when a region says “not equal”, it is natural to think the rule is already satisfied for free: the tiles are all different, so what is there to break?

But regions do not contain tiles. They contain squares, and each square carries one number. Two entirely different dominoes can both put a 4 into the same region — one from a 4-1 and one from a 4-6 — and the region now holds two 4s. That breaks ≠, even though no domino was reused.

Why it is tighter than it looks

There are only seven pip values, 0 through 6. That gives ≠ a hard ceiling: a region of seven squares under ≠ must contain every single value exactly once, with no freedom at all. A six-square ≠ region is only one step less severe.

This is why large ≠ regions are worth attacking early. They look permissive — no target number to hit — but they eliminate more arrangements than a mid-range exact sum does.

How big ≠ regions actually get here

The seven-value ceiling above is a fact about the format. What a player actually meets is narrower, and it is worth stating plainly rather than leaving you to infer it. Measured across every board this site has published — 1,143 boards, 1,329 ≠ regions among them — the largest ≠ region ever generated is 5 squares, and the median is 2.

So the six- and seven-square monsters described above are theoretical here. In practice a ≠ region is usually two squares, which reduces the rule to something very simple and very useful: this pair cannot be a double. That single reading covers the majority of the ≠ badges you will ever see, and it is a much faster thing to hold in your head than the general case.

The larger ones still matter because they are where the rule bites hardest — a five-square ≠ region rules out about 85% of raw value combinations — but they are the minority. Read the small ones as a no-doubles rule and save the careful counting for the rare big one.

Doubles and ≠

A double — 3-3, 5-5, 0-0 — carries the same value on both halves. It can never lie entirely inside a ≠ region, because it would immediately put two identical values there. A double can still touch a ≠ region, but only by straddling the boundary so that one half lands outside.

That single observation resolves a lot of stuck hard boards. Count your doubles, look at your ≠ regions, and you often find that a double's position is forced before you have placed anything else.

How it differs from the others

• ≠ constrains values relative to each other. It says nothing about what any individual value is.
• = is its exact opposite: every value must match.
• < and > constrain each value independently against a fixed number, and say nothing about repeats — a < 4 region is perfectly happy holding 3, 3, 3.
• = n constrains only the total, so repeats are fine there too.

How many arrangements ≠ actually removes

It is worth seeing the numbers, because the rule feels permissive and is not. With seven possible values per square, a region of n squares has 7ⁿ possible value combinations before any rule applies. Requiring all values distinct cuts that to a falling product — 7×6×5×… :

On a two-square region ≠ barely matters — it only forbids the seven doubles. By four squares it has removed roughly two-thirds of the space, and by six it has removed almost everything. This is why a large ≠ region is worth attacking before a mid-range exact sum, even though the sum looks like the more specific instruction.

Three mistakes that look like bugs

When players report a board as broken, the report almost always traces to one of these:

1. Counting tiles instead of values. “All my dominoes are different, so ≠ is satisfied.” It is not. The rule looks at the numbers sitting in the region, and two distinct tiles can both deliver a 4.
2. Assuming ≠ applies across regions. It does not. Two separate ≠ regions can each contain a 5 quite legally. The rule is scoped to one region, and a value repeating elsewhere on the board is irrelevant to it.
3. Trying to fit a double inside a ≠ region. A double puts the same value on both its squares. If both of those squares are inside the same ≠ region, the rule breaks the instant the tile lands — the placement was never legal, regardless of what the rest of the board looks like.

Using ≠ as a lever rather than an obstacle

Because ≠ interacts so sharply with doubles, the two together often solve a board for you. Count the doubles in your tray, then look at the ≠ regions. Every double must place at least one half outside every ≠ region it touches. On a board with several doubles and one large all-different region, that constraint alone can fix where three or four tiles go before you have made a single deductive step about sums.

The mirror trick works on the = badge. An all-equal region wants repeats, so it is the natural home for a double — and if an all-equal region spans an even number of squares, a double covering two of them is frequently the cleanest way to satisfy it.

Neither shortcut is available on every board. But when a board has both doubles and an equality rule, checking their interaction first is almost always faster than starting from the sums, and it is the habit that most separates people who finish hard boards from people who stall on them.

Where ≠ hides in a real solve

The rule rarely breaks when you are looking at it. It breaks three moves later, at the board's edges, in the ways experience teaches you to pre-empt:

• The second half you forgot. You place a tile to satisfy the region under your thumb; its other half drops a value into a ≠ region you were not thinking about. This is the straddle rule working against you — the fix is the same neighbour-check habit that catches overshot sums.
• The last two squares. A ≠ region with two empty squares and five values already placed has at most two legal values left for them. If your remaining tray cannot supply that pair on one tile or two reachable tiles, the board died several moves ago. Counting this early is what saves late undo-chains.
• The forced repeat. Sometimes every tile that can physically reach a ≠ square carries a value the region already holds. That is not bad luck at the end — it was visible at the start, in the gap between the region's size and the spread of values in your tray. The capacity count below catches it in seconds.

Three drills that make ≠ automatic

Knowing the rule and applying it under pressure are different skills. These drills use boards you already have access to and take a few minutes each:

1. The doubles-first pass. Open any archive board with a ≠ region. Before placing anything, point at each double in your tray and name where it cannot go. Only then start solving. After five boards this check runs itself, and it is the single highest-value ≠ habit.
2. The capacity count. When you meet a ≠ region, say its size aloud against seven. A six-square ≠ region has almost no freedom — it must use six of the seven values. Training yourself to feel “big ≠ = nearly forced” reverses the beginner instinct that no-target-number means no-information.
3. The violation hunt. On a board you have already solved, deliberately swap two tiles so a ≠ region holds a repeat, and watch which region goes red. Seeing the failure teaches the rule's scope — the repeat breaks one region, not the board — faster than any amount of reading.

When a ≠ region and an = region appear on the same board, run drill one on both: every double is repelled by the first and attracted to the second, and boards that deal you both are usually solvable from that observation alone.

Quick answers

What does not equal mean in pips?

The ≠ badge means no two pip values inside that region may be the same. Every square in the region must show a different number.

Does ≠ mean the dominoes must be different?

No, and this is the usual misreading. Your dominoes are already all different from each other. The rule constrains the values that end up inside the region, which can arrive from different tiles.

Can two ≠ regions on the same board share a value?

Yes. The rule is scoped to a single region. One ≠ region holding a 5 says nothing about any other region — a 5 can appear in every region on the board so long as no single ≠ region contains it twice.

Does a blank (0) count as a value under ≠?

Yes. Zero is a value like any other, so two blanks inside one ≠ region break the rule exactly as two 4s would. The 0-0 double is as constrained by ≠ regions as every other double.

Is ≠ harder than an exact sum?

On small regions, no — a two-square ≠ region only bans doubles. On large regions, considerably: a six-square ≠ region eliminates roughly 96% of raw value combinations, far more than a mid-range sum does. Its difficulty scales with size in a way sums do not.

How many squares can a ≠ region have?

At most seven, because there are only seven distinct pip values (0 through 6). A region of seven squares under ≠ must contain every value exactly once.