GAME MECHANICS HOARD

LOGIC GRIDS

Puzzles solved by deducing which combinations of attributes are possible on a constrained grid — the classic 'Einstein puzzle' matrix, nonograms/Picross, Sudoku variants, Minesweeper's mine deduction.

Picross and Sudoku carry entire franchises, Minesweeper shipped on every PC for decades, and games like Murder by Numbers and The Case of the Golden Idol embed grid deduction inside narratives. Designers use logic grids because they deliver pure deduction with mechanical verification: every cell is either provable or not yet provable, the ruleset fits in two sentences, and the difficulty curve is tunable with surgical precision by controlling how many inference steps the hardest cell requires. The form also produces a distinctive flow state — long chains of small certainties — that few other puzzle types match, and content generation can be automated once a solver guarantees unique solutions. Key decisions: whether guessing is ever required (a grid with forced guesses betrays the genre's contract — Minesweeper's classic sin), what notation and pencil-mark support the interface provides (serious players live in annotations), and how errors surface — instant correction kills deduction's stakes, silent errors compound into unfixable messes. Pitfall: generated puzzles validated only for solvability rather than for inference quality — a technically-unique solution that requires bifurcation (try both, see which contradicts) feels like trial and error, and players blame themselves for what is actually a generator that can't tell elegant from grindy.

SEEN IN

VIEW “LOGIC GRIDS” IN THE MAP ▶