| Part of a series on |
| Puzzles |
|---|
 |
|
Types |
|
|
|
Lists |
|
|
 |
This article needs additional citations for verification. Please help improve this articlebyadding citations to reliable sources. Unsourced material may be challenged and removed.
Find sources: "Dissection puzzle" – news · newspapers · books · scholar · JSTOR (May 2016) (Learn how and when to remove this message) |
Adissection puzzle, also called a transformation puzzle or Richter puzzle,[1] is a tiling puzzle where a set of pieces can be assembled in different ways to produce two or more distinct geometric shapes. The creation of new dissection puzzles is also considered to be a type of dissection puzzle. Puzzles may include various restraints, such as hinged pieces, pieces that can fold, or pieces that can twist. Creators of new dissection puzzles emphasize using a minimum number of pieces, or creating novel situations, such as ensuring that every piece connects to another with a hinge.
Dissection puzzles are an early form of geometric puzzle. The earliest known descriptions of dissection puzzles are from the time of Plato (427–347 BCE) in Ancient Greece, and involve the challenge of turning two equal squares into one larger square using four pieces. Other ancient dissection puzzles were used as graphic depictions of the Pythagorean theorem (see square trisection). A famous ancient Greek dissection puzzle is the Ostomachion, a mathematical treatise attributed to Archimedes; now the two equal squares are turned into one square in fourteen pieces by subdivision of the previous four pieces.
In the 10th century, Arabic mathematicians used geometric dissections in their commentaries on Euclid's Elements. In the 18th century, Chinese scholar Tai Chen described an elegant dissection for approximating the value of π.
The puzzles saw a major increase in general popularity in the late 19th century when newspapers and magazines began running dissection puzzles. Puzzle creators Sam Loyd in the United States and Henry Dudeney in the United Kingdom were among the most published. Since then, dissection puzzles have been used for entertainment and maths education, and creation of complex dissection puzzles is considered an exercise of geometric principles by mathematicians and math students.
The dissections of regular polygons and other simple geometric shapes into another such shape was the subject of Martin Gardner's November 1961 "Mathematical Games column" in Scientific American. The haberdasher's problem shown in the figure below shows how to divide up a square and rearrange the pieces to make an equilateral triangle. The column included a table of such best known dissections involving the square, pentagon, hexagon, greek cross, and so on.
Some types of dissection puzzle are intended to create a large number of different geometric shapes. The tangram is a popular dissection puzzle of this type. The seven pieces can be configured into one of a few home shapes, such as the large square and rectangle that the pieces are often stored in, to any number of smaller squares, triangles, parallelograms, or esoteric shapes and figures. Some geometric forms are easy to create, while others present an extreme challenge. This variability has ensured the puzzle's popularity.
Other dissections are intended to move between a pair of geometric shapes, such as a triangle to a square, or a square to a five-pointed star. A dissection puzzle of this description is the haberdasher's problem, proposed in 1907 by Henry Dudeney. The puzzle is a dissection of a triangle to a square, in only four pieces. It is one of the simplest regular polygon to square dissections known, and is now a classic example. It is not known whether a dissection of an equilateral triangle to a square is possible with three pieces.
The missing square puzzle, in its various forms, is an optical illusion where there appears to be an equidecomposition between two shapes of unequal area. A vanishing puzzle is another illusion showing different numbers of a certain object when parts of the puzzle are moved around.[2]
