Kakuro Links: Categorized Reference

A categorized and annotated reference derived from the project's collected resources. Checked June 2026.

How to Play & Solve

Introductory guides and technique references for players at all levels.

How to Solve Kakuro Puzzles — Practical guide covering the core solving methods: identifying sums with unique digit combinations, using row/column restrictions to eliminate candidates, finding common digits at clue intersections, and computing min/max values to narrow possibilities.
How to Solve Kakuro: 6 Steps (with Pictures) — Illustrated step-by-step beginner walkthrough on wikiHow covering how to read the grid, fill forced cells, and use process of elimination.

Deeper dives into the logic and number theory behind Kakuro.

Tips on solving (3): The mathematics of Kakuro — In-depth treatment from the Tata Institute of Fundamental Research. Covers identifying "unique partitions" (sums with only one digit combination), treating the puzzle as an algebraic spreadsheet to reduce unknowns, isolating self-contained blocks solvable independently, and applying Type 1/Type 2 inequalities to assign remaining free variables.
Kakuro Trivia — For The Morbidly Curious — A compendium of Kakuro statistics and structural curiosities; examines the mathematical properties of puzzle grids.

Software implementations and algorithmic approaches to solving Kakuro.

OddThinking » A Kakuro Solver — Python solver using constraint propagation rather than backtracking. The algorithm enumerates valid digit combinations for each clue, then iteratively eliminates values absent from both horizontal and vertical candidate lists. The author reports solving novice and difficult puzzles in roughly 25 seconds each — demonstrating that simple human-style elimination, when systematically applied, is sufficient for most puzzles.
kakuro-solver Algorithm.cs (GitHub) — C# constraint satisfaction solver combining backtracking with heuristic cell selection. Chooses the cell with the fewest legal options at each step, validates candidates against no-repeat and feasible-sum-range constraints, and uses min/max sum calculations to prune the search space before recursing deeper.

Bitboard — Wikipedia — Overview of bitboards, a data structure that maps game-board squares to individual bits, enabling game state queries and moves through parallel bitwise operations. Used in high-performance chess engines and adaptable to Kakuro solvers for rapid candidate-set manipulation.

Resources on constructing and generating valid Kakuro puzzles.

kakuro puzzle generator (PerlMonks) — Perl script generating random Kakuro grids by filling an N×N board with numbered sequences summing to specified totals. The author acknowledges limitations: no uniqueness guarantees and no test for logical solvability. Commenters note that professional-quality puzzles require additional constraints — no permutation appearing twice, and solutions reachable through deduction alone.
New Kakuro Generator/Site (EnjoyKakuro forum) — Forum thread (66 posts, 2013) announcing kakuro-online.com, a JavaScript generator running entirely in the browser, capable of producing puzzles up to 20×20 across multiple difficulty settings. Community feedback discusses surface-sum difficulty, naked triples detection, and the gap between browser-generated puzzles and the harder ATK-style puzzles.

The core construction challenge: ensuring exactly one valid solution exists.

Creating a Kakuro puzzle with a unique solution (Puzzling SE) — Stack Exchange Q&A on techniques for guaranteeing uniqueness during puzzle construction, including generate-and-check approaches and constraint-based methods.
Strategies for creating a cross sums puzzle with a unique solution (Puzzling SE) — Companion thread with alternate construction strategies and community debate on the uniqueness problem.

Sites where Kakuro can be played directly in the browser.

Kakuro Conquest — Free browser-based Kakuro in five difficulty levels (easy through expert) and five grid sizes (4×4 to 9×17). No registration required; puzzles generate instantly.

Puzzles and open-source projects that share technical or conceptual DNA with Kakuro.

Killer Sudoku — Wikipedia — Killer Sudoku combines standard Sudoku grid constraints (unique digits per row, column, and 3×3 box) with cage-sum requirements identical in spirit to Kakuro's run clues. The Wikipedia article covers rules, solving techniques, and the relationship between the two puzzle types.
nojvek/uber-sudoku (GitHub) — A playable Sudoku implementation supporting 2×2, 3×3, and 4×4 grid sizes with responsive design for mobile and desktop. Built with CoffeeScript, Vue.js, and Gulp; useful as a reference architecture for browser-based logic puzzle UIs.
Michael Fogleman — Rush Hour solver — Complete database of all solvable Rush Hour puzzle configurations, built using a bitboard-backed solver and enumerator. Fogleman's approach — canonical state representation, lexicographical ordering, and bitwise operations to skip redundant computation — is a useful model for anyone building a high-performance Kakuro generator or solver.

Kakuro — Wikipedia — Comprehensive encyclopedia article covering history (1966 Dell Magazines origin, 1980 Nikoli introduction to Japan), rules, solving techniques, and computational complexity (NP-complete). The canonical starting reference for the puzzle.