Mastering Inequality Chains: The Key Futoshiki Technique

If there's one technique that separates people who breeze through Futoshiki from people who stall, it's reading inequality chains. The greater-than and less-than signs scattered across the grid aren't isolated clues — they link up into runs, and a run of arrows is far more powerful than any single one. A long chain of < signs can pin down several cells at once, sometimes the entire run in one move. This guide is a deep dive into inequality chains: what they are, how they force digits, and exactly how to use them to crack hard Futoshiki puzzles. Master this and the rest of your solving gets dramatically faster.

New to the puzzle? Read the Futoshiki rules or the beginner walkthrough first, then come back for the technique that levels you up.

What an inequality chain is

An inequality chain is a sequence of cells connected by arrows all pointing the same way along a row or column — for example a < b < c < d. Because each arrow demands a strict increase (or decrease), the values must climb steadily along the run. There are no ties and no repeats, so the chain behaves like a staircase: every step is strictly higher than the last.

That staircase property is the whole source of the technique's power. The longer the chain, the less freedom it has.

Why long chains force digits

Here's the key insight. In an N×N grid, the digits in any line run from 1 to N. A chain of strictly increasing cells has to fit inside that range in order, which limits things fast:

• A full-length chain (length N) has exactly one solution. In a 5×5 grid, a < b < c < d < e can only be 1, 2, 3, 4, 5 — there's no other way to place five strictly increasing digits from 1–5.
• A near-full chain has very few options. A four-cell increasing chain in a 5×5 grid must be one of just a handful of climbing sequences.
• Even a short chain sets hard bounds: the first cell of an increasing run of length k can be at most N−k+1 (it needs room for the cells above it), and the last cell is at least k.

So before you do anything else, find the longest chain on the board and ask how many ways it can possibly be filled. Often the answer is "one."

The minimum/maximum bound trick

You don't need a full-length chain to get value. Every chain imposes bounds on its end cells:

• In an increasing chain a < b < c, the smallest cell a must leave room above it, so in a 5×5 grid a ≤ 3. The largest cell c must leave room below it, so c ≥ 3.
• Flip it for decreasing chains.

Apply these bounds and a cell's candidate list shrinks immediately, often before any given digit comes into play. Stacking the bounds from both ends — the low end can't be too high, the high end can't be too low — is the fastest way to thin candidates along a run.

A worked example

Picture a 5×5 Futoshiki with this row of arrows: cell1 < cell2 < cell3, then cell4, cell5 unconstrained by arrows in this row.

• The three-cell increasing chain (cell1 < cell2 < cell3) means cell1 ≤ 3 and cell3 ≥ 3.
• Suppose cell5 is given as 3. Now 3 is used in the row, so cell3 (which needed to be ≥ 3) must be 4 or 5, and cell1 (≤ 3) drops 3, leaving 1 or 2.
• Say cell2's column already contains 4. Then in the chain cell1 < cell2 < cell3, with cell3 being 4 or 5 and 4 unavailable to cell2, the climbing order forces cell2 = 2 (since it's above cell1 and below cell3, and can't be 4). That pins cell1 = 1 and cell3 = 5.

Three cells locked from one chain plus one given digit and one column fact. That's inequality-chain reasoning doing what no single arrow could.

How to spot and use chains efficiently

A few habits make chains pay off faster:

• Trace every run of same-direction arrows before placing digits, and note its length.
• Attack the longest chain first — it has the fewest possible fillings.
• Write the end-cell bounds (max for the low end, min for the high end) as pencil marks.
• Re-check a chain whenever a digit lands in its row or column — one new value often collapses the rest of the run.

Where chains fit in your overall approach

Inequality chains aren't the whole game — you still need the Latin square rule, candidate elimination, and the standard sudoku-style singles and pairs. But chains are the deduction that produces digits when nothing else will, which is why they sit near the top of the Futoshiki strategy guide. When you're stuck, the answer is almost always in a chain you haven't fully read. For the moves beyond chains, see advanced Futoshiki techniques.

Want to try it live? Open a hard 6×6 Futoshiki, find the longest run of arrows, and write down its end-cell bounds. The first time a chain just resolves itself, you'll never solve without checking for them again.

Frequently asked questions

What is an inequality chain in Futoshiki?

An inequality chain is a run of cells connected by arrows all pointing the same direction, like a < b < c < d. The values must strictly increase (or decrease) along the run, so the chain behaves like a staircase — and the longer it is, the fewer ways it can be filled.

How do inequality chains help you solve Futoshiki?

Because a strictly increasing chain must fit the digits 1 to N in order, a long chain collapses to very few arrangements — a full-length chain has exactly one. Even short chains set hard bounds on their end cells, letting you eliminate candidates before any given digit is used.

What is the longest useful chain in Futoshiki?

A chain equal to the grid size (length N) is the most useful, because it has a single solution: the digits 1 to N in order. In a 5×5 grid, a five-cell increasing chain can only be 1, 2, 3, 4, 5. Always look for the longest chain on the board first.

How do I find inequality chains?

Scan each row and column for consecutive arrows pointing the same way and trace how far the run extends. Note its length, then write the bounds it imposes: the low end can't be too high, and the high end can't be too low, leaving room for the cells between them.

Are inequality chains enough to solve Futoshiki on their own?

Usually not by themselves, but they're the most powerful single technique. You combine them with the Latin square rule and standard elimination like naked singles and pairs. On hard puzzles, a chain is often the move that breaks a stall when nothing else works.