Main Page | See live article | Alphabetical index Matchstick puzzles are transport puzzles in which a number of matchsticks are arranged as squares, rectangles or triangles. The problem to solve is usually formulated as : move n (some specified number) matchsticks to make m (another specified number) squares (or triangles, or rectangles). This article is from Wikipedia. All text is available under the terms of the GNU Free Documentation License.