Pencil-and-Paper Puzzles

This chapter introduces a wide variety of pencil-and-paper puzzles , emphasizing their accessibility, mathematical structure, and algorithmic depth. Beginning with familiar examples such as mazes, logic puzzles, and path-drawing problems, the chapter explains how simple rules on paper can lead to rich combinatorial challenges. Particular attention is given to Japanese puzzle genres, including popular logic puzzles that have gained worldwide recognition through newspapers, magazines, and puzzle collections. The chapter discusses how these puzzles can often be interpreted as graph-theoretic or constraint-satisfaction problems, making them closely related to topics in algorithms and computational complexity. It also introduces puzzle-solving techniques based on deduction, parity arguments, and local consistency conditions. Several puzzles are analyzed from the perspective of theoretical computer science, illustrating that even seemingly simple pencil-and-paper puzzles may become computationally difficult when generalized. Through historical remarks, representative examples, and mathematical explanations, the chapter demonstrates how recreational puzzles serve as an engaging bridge between entertainment, logical reasoning, and modern computational theory.