Matchstick puzzles are transport 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).
All Wikipedia text
is available under the
terms of the GNU Free Documentation License
Search Encyclopedia
Search over one million articles, find something about almost anything!
... supercillious sophisticate. His most famous role is that of the cranky professor forced to stay immobile because of a broken leg in 1942's The Man Who Came to Dinner[?], ...