Futoshiki
A Latin square puzzle with inequality signs pointing between neighboring numbers.
Basic Game Premise & Rules
MechanicsFutoshiki is an untimed, deterministic pencil-and-paper logic puzzle played on a grid. Every valid puzzle has exactly one unique solution that can be discovered through rigorous deductive reasoning alone, without trial and error or guessing.
- Fill the grid so every row and column holds each number from 1 up to the grid dimension exactly once.
- Inequality signs (<, >, ∧, ∨) between adjacent cells must be respected: the narrow end always points to the smaller number.
- Initial given numbers and inequality signs cannot be altered.
- Cells without signs between them may hold numbers in any order as long as Latin square rules are satisfied.
- Every puzzle has exactly one valid solution deducible through order theory without guessing.
Rules by Example
See how each rule looks when done correctly versus when violated:
Each Number Once
Every row and every column holds each number from 1 up to the grid's size exactly once.
Signs Point at the Smaller Number
The narrow end of a sign points at the smaller of its two numbers: 1 < 2 across, and down a column ∧ has the smaller number above, ∨ below.
History & Origins
Origins & EvolutionFutoshiki was developed in Japan by Nikoli in 2001. The name *Futoshiki* (不等式) translates literally as 'inequality'.
By embedding partial order relations (inequalities) into an unadorned Latin square, Nikoli created an immensely satisfying puzzle. In 2006, *The Guardian* and *The Daily Telegraph* introduced the game to the West, where it became a staple alongside Sudoku and Kakuro. Its beauty lies in how inequality chains (such as A < B < C < D) immediately establish rigid lower and upper numerical bounds.
Mathematical Concepts & Computational Complexity
Computer Science & Discrete MathBeyond its entertainment value, Futoshiki formalizes core principles of discrete mathematics, theoretical computer science, and combinatorics:
Partially Ordered Sets (Posets) & Topological Sorting
The inequality signs define a directed acyclic graph (DAG) representing a strict partial order P = (V, ≺) on the grid. Every row and column must be a linear extension of the induced sub-poset, subject to Latin square uniqueness. A chain of length k forces the terminal node to have value ≥ k, and the initial node to have value ≤ N - k + 1.
NP-Completeness via 3-SAT
In 2016, S. Kochemazov et al. proved that Futoshiki is NP-complete. By constructing comparator gadgets and Latin square clique channels, they showed that resolving cycles of inequality implications is computationally intractable in general.
Domain Pruning & Arc Consistency
In Constraint Satisfaction, Futoshiki is solved efficiently via AC-3 (Arc Consistency): for any constraint x < y, Dom(x) is filtered to {d ∈ Dom(x) | d < max(Dom(y))}, and Dom(y) is filtered to {d ∈ Dom(y) | d > min(Dom(x))}. When combined with AllDifferent constraints on lines, arc consistency solves most human-grade puzzles in milliseconds.
References & Further Reading
Bibliography- Kochemazov, S., et al. (2016). 'On the Computational Complexity of the Futoshiki Puzzle'. Optimization and Applications.
- Nikoli (2001). Puzzle Communication Nikoli #97. Tokyo: Nikoli Publishing.
- Colbourn, C. J. (1984). 'The complexity of completing partial Latin squares'.
Free Printable PDF Booklet
Download our beautifully formatted, high-resolution A4 puzzle booklet. Generated directly from the handcrafted levels on AZTest, it contains 50 puzzles ordered from gentle introductory boards up to master-level challenges, followed by complete solutions at the back.
| Difficulty Stage | Grid Size | Description | Puzzles |
|---|---|---|---|
| Intro | 4×4 | Small 4×4 boards with long inequality chains and obvious bounds. | 3 |
| Easy | 4×4 to 5×5 | Single-candidate exclusions and corner inequality traps. | 12 |
| Medium | 5×5 to 6×6 | Interlocking row/column inequality chains and pair reductions. | 12 |
| Hard | 6×6 to 7×7 | Sparse signs requiring Latin square cycle chasing. | 12 |
| Expert | 7×7 | Master boards with minimal clues and subtle inequality loops. | 11 |
Explore More Logic Puzzles
SeriesSlitherlink
Connect dots to draw a single unbroken loop guided by surrounding cell numbers.
Wolves & Sheep
Draw a Slitherlink loop that fences the gentle sheep in and keeps the fierce wolves out.
Masyu
Draw one closed loop through cell centres that rigorously obeys the black and white pearls.
Nurikabe
Shade the sea to leave numbered white islands of exact sizes in one connected ocean.
Nonogram
Shade runs of cells according to row and column number clues to reveal a hidden picture.
Themed Nonogram
Solve color picture cross puzzles that blossom into vibrant pixel art upon completion.
Hitori
Shade the repeated numbers until every row and column has unique digits, keeping all white cells connected.
Kurodoko
Shade cells so every numbered circle sees exactly that many white cells in its row and column.
Mosaic
Shade cells guided by numbers that count how many cells around them are filled, revealing a hidden picture.
Binairo
Fill every cell with blue or white circles: never three in a row, every line half and half.
Heyawake
Shade rooms according to their clues without isolating unshaded cells or leaving long straight corridors.
Searchlights
Place light beams in white cells so that every numbered black post sees its exact clue count.
Light Up
Place light bulbs to illuminate every white cell without any two shining on each other.
Calcudoku
A Latin square where every outlined cage satisfies its arithmetic target and operator.
Skyscrapers
Place towers of heights 1 to N so that each outside clue sees the exact count of buildings.
Sum Skyscrapers
Skyscrapers where each outside clue is the sum of the heights of all visible buildings.
Suguru
The elegant polyomino number puzzle where no two identical digits can touch, even diagonally.
Fillomino
Divide the grid into polyomino blocks where each cell's number equals the area of its block.
Galaxies
Partition the grid into rotational 180° symmetric galaxies, each centered on a single dot.
Shikaku
Cut the whole grid into rectangles and squares, each containing exactly one number: its area.
L-Pieces
Draw borders to partition all white cells into perfect four-cell L-shapes.
Numberlink
Connect pairs of matching numbers with continuous non-crossing paths covering the grid.
Bridges
Connect the island network with straight horizontal and vertical bridges into one united world.
Slant
Draw a diagonal slash in every cell matching the corner numbers, without ever closing a loop.
Tents
Pitch a tent beside every tree with no two tents touching, matching row and column counts.
Marupeke
Place circles and crosses in every cell without creating three in a row in any direction.