Jump to content

Matchstick puzzle

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Cmglee (talk | contribs) at 17:03, 4 September 2022 (→‎top: Add example diagram). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Examples of matchstick puzzles
1. Picture puzzle Move 3 matchsticks to make the fish face right
2. Roman numerals Move 1 matchstick to make the equation valid
3. Shape counting Move 2 matchsticks to make 5 squares
4. Arithmetic Move 1 matchstick to make the equation valid
In the SVG file, hover over each puzzle for its solution

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][dubiousdiscuss]

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

  1. ^ Weisstein, Eric W. "Match Problem". Retrieved 21 December 2021.
  2. ^ Delft, Pieter van (1978). Creative puzzles of the world. New York: H.N. Abrams. ISBN 0810921529.