Matchstick puzzles are rearrangement puzzles in which a number of matchsticks are arranged as squares, rectangles or triangles. The problem to solve is usually formulated as: "move n matchsticks to make m squares, triangles, or rectangles". Some match stick problems are solved with planar topological graphs. [1][ dubious – discuss]
Other matchstick puzzles require lateral thinking and are not just about making geometric shapes.
Different three-dimensional matchstick arrangements are also possible [2] as puzzles held together with friction. However, none of these are produced yet.
How to solve them
Different number puzzles (see the top) can also be implemented. They are usually implemented using seven-segment displays. Also, they would be an ideal puzzle if the number of matchsticks to move is 1, 2 or 3.
References
- ^ Weisstein, Eric W. "Match Problem". Retrieved 21 December 2021.
- ^ Delft, Pieter van (1978). Creative puzzles of the world. New York: H.N. Abrams. ISBN 0810921529.
 | This puzzle/logic game-related article is a stub. You can help Wikipedia by expanding it. |