Matchstick puzzle

From Wikipedia, the free encyclopedia
Jump to: navigation, search

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 (some specified number) matchsticks to make m (another specified number) squares (or triangles, or rectangles,or circles) ).

However some of the puzzles require lateral thinking and are not just about making geometric shapes.

[edit] External links

Personal tools
Namespaces
Variants
Actions
Navigation
Interaction
Toolbox
Print/export
Languages