Futoshiki Puzzles, Explained

After reading this you will know how a futoshiki puzzle is built, why the inequality signs carry as much information as given digits, and how to solve one by combining Latin square logic with the chains of < and > between cells.

What a futoshiki puzzle is

A futoshiki puzzle is a Latin square with inequality clues. On an n by n grid you place the numbers 1 through n so that each row and each column holds every number exactly once. Between some pairs of horizontally or vertically adjacent cells sits a < or > sign. The sign always points at the smaller number, so 3 > 1 is valid and 2 < 5 is valid.

Consider a 4 by 4 grid. Suppose the top-left cell has a sign chain reading a \lt b \lt c across the first three cells of row one. Since the values come from 1 to 4 and must strictly increase across three cells, the only options are 1,2,3 or 1,2,4 or 1,3,4 or 2,3,4. One chain of two signs has already cut a full row of 24 permutations down to a handful. That compression is the whole appeal: a few well-placed signs do the work that a dozen given digits would do in sudoku.

When to use it, and when not

Reach for futoshiki when you want a puzzle that teaches ordering and transitivity, not just the "each symbol once" constraint. A 4 by 4 grid suits a first grader who can count to four and compare two numbers. A 7 by 7 grid with a minimal clue set will occupy an adult for fifteen minutes or more.

Skip it if your solvers have never met a Latin square. Start them on a small sudoku or a 4 by 4 futoshiki with many given digits. Skip it too if you need a puzzle that scales to large sizes: futoshiki stays interesting only up to about 9 by 9, because a strict inequality chain longer than the grid width is impossible and the sign density needed to keep the solution unique climbs quickly.

For a classroom warm-up, generate a 5 by 5 on easy difficulty. Easy keeps every helpful clue, so students rarely hit a dead end and can check each deduction against a visible sign.

Counting the search space

The number of Latin squares of order n grows fast. That count sets the size of the haystack the generator searches before it plants clues.

L(n) = 1,\ 2,\ 12,\ 576,\ 161280,\ 812851200 \quad \text{for } n = 1 \dots 6

Here L(n) is the number of distinct Latin squares of order n. For n = 4 there are 576. For n = 5 there are 161,280. For n = 6 the figure is 812,851,200, and for n = 7 it exceeds 6.1 \times 10^{16}. The generator does not enumerate these. It fills one random valid grid, then adds clues until the solution is forced to be unique.

The clue budget matters. If a grid has c inequality signs, the maximum possible number of adjacent-pair sign slots on an n by n board is 2n(n-1). For a 5 by 5 that is 2 \times 5 \times 4 = 40 possible sign positions. A typical hard 5 by 5 uses only 8 to 12 of them plus zero or one given digit, so the solver must lean hard on transitivity.

A worked 4 by 4 example

The demo button generates a 4 by 4 puzzle on medium difficulty. The reasoning below reproduces that kind of grid step by step so you can follow the logic with a pencil.

Solving a 4 by 4 with two sign chains

Label rows 1 to 4 top to bottom and columns 1 to 4 left to right, so R2C3 means row 2, column 3. Suppose the clues are: R1C1 < R1C2, R1C2 < R1C3, a given 4 at R3C1, and R4C2 > R4C3.

Row 1 has the chain R1C1 \lt R1C2 \lt R1C3. Three strictly increasing values from 1..4. The fourth cell R1C4 is free.
Column 1 already contains 4 at R3C1. So R1C1 cannot be 4. Combined with being the smallest of its chain, R1C1 is 1 or 2.
Try R1C1 = 1. Then R1C2 and R1C3 are two increasing values above 1, and R1C4 takes the leftover. Test R1C2 = 2, R1C3 = 3, R1C4 = 4. That satisfies both signs.
Now propagate column 1: with R3C1 = 4 and R1C1 = 1, the cells R2C1 and R4C1 hold 2 and 3 in some order.
Apply the row 4 sign R4C2 \gt R4C3 together with each row and column's "once only" rule. Only one full assignment survives every check, which is what the generator verified before showing the puzzle.

The point of the walk-through: the signs never told you a specific digit. They told you an order, and the Latin square rule turned that order into digits.

How the generator guarantees one solution

Every puzzle passes through a backtracking solver before display. The solver tries values cell by cell, backs up when a row, column, or sign is violated, and counts how many complete solutions exist. Generation stops adding clues only when that count is exactly 1.

Difficulty then controls pruning. On easy, the generator keeps every clue that helped narrow the search. On hard, it removes each clue whose deletion still leaves the solution unique, one at a time, until no clue can be removed without creating a second solution. The result is a minimal clue set. The same underlying grid can therefore appear as an easy puzzle with 14 signs or a hard puzzle with 9 signs.

Uniqueness is a property of the whole clue set, not of any single sign. Removing one sign from a minimal hard puzzle typically produces a puzzle with two or more solutions, which is why hard puzzles feel fragile: there is no slack.

Reading clue density against difficulty

Clue count is the clearest single predictor of how hard a futoshiki feels. The table below shows typical sign counts the generator lands on for each size on medium difficulty, out of the maximum 2n(n-1) slots.

Typical medium-difficulty sign counts by grid size
Grid size	Max sign slots	Typical signs used	Given digits	Density
4×4	24	7	1	0.29
5×5	40	11	1	0.28
6×6	60	16	2	0.27
7×7	84	22	2	0.26

Density holds near 0.27 across sizes because the ratio of constraints to cells that yields a single solution stays roughly constant. On hard difficulty each of those sign counts drops by 25 to 40 percent after pruning, and the given digits often fall to zero.

The gap between the two bars is the unused adjacency slots. Notice how the medium bar stays near a quarter of the maximum at every size.

Common mistakes when solving

Three errors account for most stuck solvers.

Reading the sign as a digit: A > tells you which neighbor is larger, not by how much. 4 > 1 and 2 > 1 are both legal. Never assume the difference is one.
Ignoring chain endpoints: In a chain a \lt b \lt c \lt d spanning four cells of a size-4 row, the values are forced to 1,2,3,4 exactly. The first cell must be the row minimum and the last must be the maximum. Beginners often solve the middle and forget the ends are pinned.
Dropping the Latin rule: The signs are extra constraints, not replacements. Every deduction must still respect "each number once per row and column". A value that satisfies a sign but repeats in its column is wrong.

Do not guess and hope. Because minimal hard puzzles have a unique solution with no slack, a single wrong guess propagates into a contradiction several cells away, and it is hard to trace which guess caused it. Use the on-page checking feature after each firm deduction instead.

Related puzzle generators

Futoshiki sits in a family of Latin square and grid puzzles on this site. The KenKen (Calcudoku) Generator also builds Latin squares, but it replaces inequality signs with arithmetic cages, so the constraint is a sum or product rather than an order. The Skyscrapers Puzzle Generator keeps the Latin square base and uses edge clues about visibility, another way to encode order.

If you want the classic block-based number placement instead, the Sudoku Generator adds the 3 by 3 box rule. For sum-based logic without a Latin square, try the Kakuro Generator. For a picture-building puzzle with row and column run clues, see the Nonogram Maker.

Frequently asked questions

Does every futoshiki puzzle have exactly one solution?

Every puzzle from this generator does. A backtracking solver counts complete solutions before the puzzle is shown, and generation continues until that count is exactly 1. A puzzle drawn by hand can easily have two or more solutions if the clues are too few.

Why does the hard difficulty give me fewer clues?

Hard difficulty prunes every clue the solver can prove redundant. Starting from a puzzle that is already unique, it removes clues one by one, keeping only those whose removal would create a second solution. You end with a minimal set, often 25 to 40 percent fewer signs than the easy version of the same grid.

Can a strict chain be longer than the grid?

No. On an n by n grid, a chain of strict inequalities can involve at most n cells, because the values 1 through n can increase only n - 1 times. A chain of length n forces those cells to be 1, 2, ..., n in order.

What grid size should a beginner start with?

A 4 by 4 on easy difficulty. It has at most 24 sign slots, typically uses about 7 signs plus one given digit, and every deduction is short. Move to 5 by 5 once the ordering logic feels automatic.

Are my puzzles sent to a server?

No. Generation, checking, and export all run in your browser. Your puzzles and any words you enter never leave your device.

Try it yourself in the tool