Kakuro Puzzles, Explained

After reading this you will know how a kakuro grid encodes arithmetic as logic, how to count the digit combinations behind a sum clue, and how to solve and generate puzzles that have exactly one answer.

What kakuro is

Kakuro is a number puzzle on a grid that looks like a crossword. Black cells carry clues; white cells hold digits. Each horizontal strip of white cells (an "across run") and each vertical strip (a "down run") must add up to a printed sum. Inside any single run you may use each of the digits 1 through 9 at most once. Zero is never used.

Here is the hook. Suppose an across run of two cells has the clue 3. Only one pair of distinct digits from 1 to 9 sums to 3: that is 1 and 2. So the run must contain a 1 and a 2, in some order. If a down clue crossing the left cell forces it to be even, the left cell is 2 and the right cell is 1. That single deduction shows the whole game: sums restrict which digit sets are legal, and crossings pin down the order.

A clue cell can hold two numbers. The number above the diagonal is the down sum for the run going down; the number below the diagonal is the across sum for the run going right. A cell with only one number governs only the run in that direction.

When to use it, and when not

Reach for kakuro when you want arithmetic practice that still rewards logical reasoning rather than raw calculation. The sums are small (any run of length n has a total between the smallest and largest possible), so the mental addition stays in range for ages 9 and up, while the deduction scales to any level you like.

Skip kakuro if your audience wants a pure placement puzzle with no addition. A Latin-square puzzle like the Sudoku Generator keeps the grid logic without any sums, and the KenKen (Calcudoku) Generator adds arithmetic cages onto a Latin square if you want a middle ground. For a puzzle that produces a picture, use the Nonogram Maker.

For a classroom warm-up, print an easy grid with runs of 2 to 4 cells. Those short runs have few legal digit sets, so students can start from the fully-forced clues and build confidence before meeting the longer runs.

The combinatorics of a sum clue

The heart of kakuro is this question: how many sets of n distinct digits from 1 to 9 add up to a target S? Call that count the number of legal combinations. It is the coefficient you get from choosing n different values out of 1 through 9 with a fixed sum.

C(n, S) = \#\{\, \{d_1, \dots, d_n\} \subseteq \{1,\dots,9\} : d_i \ne d_j,\ \textstyle\sum_i d_i = S \,\}

Here n is the run length, S is the clue, each d_i is a digit, and C(n, S) counts the distinct sets (order does not matter, because the crossings decide order). The smallest possible sum for length n is 1 + 2 + \dots + n, and the largest is 9 + 8 + \dots + (10 - n).

The values that matter most are the extremes, because they force a unique set. For length 2 the clue 3 forces {1,2} and the clue 17 forces {8,9}. For length 3 the clue 6 forces {1,2,3} and the clue 24 forces {7,8,9}. These forced clues are where a solve begins.

Number of legal digit sets for a run of a given length and sum
Length	Sum range	Fewest combos (which sum)	Most combos (which sum)
2	3 to 17	1 (sum 3 or 17)	4 (sum 10)
3	6 to 24	1 (sum 6 or 24)	8 (sum 15)
4	10 to 30	1 (sum 10 or 30)	12 (sum 20)
5	15 to 35	1 (sum 15 or 35)	12 (sum 25)

Notice how the count peaks at the middle sum and drops to 1 at each end. A run of length 4 with clue 20 has 12 legal sets, so on its own it tells you almost nothing. The same length with clue 10 or 30 has exactly one set, so it is fully determined. Hard puzzles lean on the crowded middle; easy puzzles hand you the ends.

For a run of two cells the count rises from 1 at the ends to a peak of 4 at sum 10, then falls back to 1. Ends are forced; the middle is ambiguous.

A worked solve on the demo puzzle

The demo button uses the default settings, which produce an easy grid built from short runs. Work a corner the way the solver does.

Starting from the forced clues

Suppose the top-left of the grid has an across run of two cells with clue 4, and the leftmost of those two cells starts a down run of two cells with clue 16.

The across clue 4 for two cells has legal sets {1,3} only, because {2,2} repeats and is banned. So the two across cells are 1 and 3 in some order.
The down clue 16 for two cells has legal sets {7,9} only. So the shared corner cell must be 7 or 9.
The corner cell belongs to both runs. From the across run it must be 1 or 3; from the down run it must be 7 or 9. Those sets do not overlap, which is impossible, so this exact pairing cannot occur in a valid grid.

That contradiction is the point. A verified puzzle never presents crossings that share no common digit. When you meet a corner where the two clues overlap in exactly one digit, that digit is forced. For a corner with across clue 4 (sets {1,3}) meeting down clue 17 for two cells (set {8,9}), no overlap exists either, so the generator would not place it. When across clue 3 ({1,2}) meets down clue 16 ({7,9}) the sets still miss, which again a valid grid avoids. Where across clue 4 ({1,3}) meets down clue 4 ({1,3}) the shared cell can be 1 or 3, and a third crossing settles it.

Solving proceeds by keeping, for each cell, the set of digits still possible, then intersecting the sets implied by its across run and its down run. When a cell's possibilities shrink to one, you write it in and propagate. Short-run easy grids collapse quickly this way. Long-run hard grids need you to test a candidate and follow the consequences, which is exactly what a backtracking solver does.

How the generator guarantees one solution

Making a grid that looks like kakuro is easy. Making one with exactly one solution takes a check. The generator lays down a black-and-white pattern chosen by difficulty, fills the white cells with a legal assignment, reads off the run sums as clues, then hands the clue-only grid to a backtracking solver and asks it to count solutions.

If the solver finds two or more completions, the puzzle is ambiguous and is discarded or adjusted. Only a grid the solver proves to have a single completion is shown to you. This matters because an ambiguous kakuro cannot be solved by logic alone: at some point you would guess, and both guesses would lead to valid finishes.

Everything runs in your browser. The pattern generation, the fill, and the uniqueness check all happen on your device, so your puzzles never leave it.

Reading difficulty correctly

Difficulty in this tool is driven by the grid pattern, not by hiding clues. Easy grids use runs of 2 to 4 cells. Hard grids allow runs up to 7 cells. Compare the combination counts: a 2-cell run has at most 4 legal sets, but a 7-cell run with clue 28 has many, because seven distinct digits summing to 28 can be arranged in numerous sets.

The practical effect is the length of your deduction chains. On an easy grid you can usually find a fully-forced clue (an extreme sum) and expand from it. On a hard grid the forced clues are rarer and the long runs stay open until several crossings combine, so you carry candidate sets further before anything resolves.

The peak number of legal digit sets rises with run length, reaching 12 for lengths 4 and 5. Longer runs keep more options open, which is why hard grids feel harder.

Common mistakes

Three errors account for most stuck solves.

Repeating a digit in a run: The no-repeat rule is per run, not per grid. A 4 can appear in many runs across the puzzle. It just cannot appear twice inside the same run. Writing {5,5} for a length-2 clue of 10 is the classic slip; the only legal length-2 set for 10 is {1,9},{2,8},{3,7} or {4,6}.
Reading the wrong half of a clue cell: The top-right number is the down sum; the bottom-left number is the across sum. Swapping them sends your whole corner off course.
Guessing on an easy grid: If you feel you must guess on an easy puzzle, you have missed a forced clue. Scan for extreme sums (length-2 clues of 3, 4, 16, 17; length-3 clues of 6, 7, 23, 24) and start there.

Do not assume a digit that "fits the sum" is placeable. It also has to fit the crossing run. A cell whose across run allows {1,3} and whose down run allows {3,4} can only be 3, even though 1 and 4 each satisfy one clue.

Related puzzle generators

If kakuro appeals, several nearby puzzles share its logic-from-constraints structure. The Futoshiki Generator replaces sums with less-than and greater-than signs between neighbours. The Skyscrapers Puzzle Generator uses edge clues that count visible towers, which trains a different kind of ordering deduction. Each produces puzzles with a unique solution, so the same "logic only, no guessing" discipline applies.

Frequently asked questions

Can a kakuro use zero or numbers above 9?

No. Every white cell holds a single digit from 1 to 9. The clue sums can be larger than 9 (a length-3 run can sum to 24), but each individual cell is one digit.

Why does my puzzle have no givens like a sudoku?

Kakuro gives you clues as sums in the black cells, not as pre-filled digits. The sums plus the no-repeat rule are enough to force a single answer, which the solver verifies before the puzzle is shown.

How can I tell a puzzle really has one solution?

The generator counts solutions with a backtracking solver and only displays a grid when the count is exactly one. You can trust that a logical path exists, so if you are stuck the missing step is a deduction, not a guess.

What makes a hard kakuro hard?

Longer runs. A run of 7 cells admits many more legal digit sets than a run of 2, so fewer clues are fully forced and you must combine several crossings before a cell resolves.

Can I print without the answer?

Yes. You can print a clean sheet with or without the solution, and export to PNG or SVG, so you can hand out the puzzle and keep the key separate.

Try it yourself in the tool