Matchstick puzzle
From Wikipedia, the free encyclopedia
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).
