Matchstick puzzle
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]
![](../I/Matchstick_puzzle_and_solution.png.webp)
A matchstick puzzle ("Move 1 matchstick to make the equation 6+4=4 valid") and its solution, below
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.
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 article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.