Deductive search for logic puzzles

Abstract

Deductive search (DS) is a breadth-first, depth-limited propagation scheme for the constraint-based solution of deduction puzzles, using simple logic operations found in standard constraint satisfaction solvers. It attempts to emulate the processing limits experienced by human solvers, and, to some extent, the process by which they solve such problems. Any solution deduced by DS is guaranteed to be correct and unique. Further, it provides an estimate of the deducibility of a given problem for human solvers and offers new ways of understanding deduction puzzles. Its performance is tested on a number of problem domains including Japanese logic puzzles, a traditional logic puzzle, and a geometric placement puzzle.