15-puzzle

15-puzzle
15-puzzle.svg: en:User:Booyabazooka · Public domain · source
Name	15-puzzle
Caption	A typical 15-puzzle configuration
Maker	Unknown
Country	United States
Year	1870s
Type	Sliding puzzle

15-puzzle

The 15-puzzle is a sliding toy and recreation puzzle that became widely popular in the United States in the 1870s and later spread to United Kingdom, France, and Germany. It consists of numbered square tiles in a frame where one tile-sized space permits sliding moves; notable cultural responses included press coverage in New York City, commentary by Sam Loyd, and mathematical analysis by William Rowan Hamilton and Édouard Lucas. The puzzle spurred investigations by mathematicians associated with Princeton University, École Normale Supérieure, and University of Göttingen into permutation groups and parity.

History

The puzzle achieved mass popularity after being promoted in New York City parlors and shops, eliciting claims by puzzle dealers and showmen in Brooklyn and Boston and spurring competitive solving in venues linked to Harvard University and Yale University. Contemporary accounts mention catalog sales through firms in Philadelphia and demonstrations at exhibitions like the Exposition Universelle (1878). Promotional narratives incorrectly attributed invention to amateur puzzler Sam Loyd, while historical evidence points to earlier wooden sliding puzzles circulating in Prussia and among craftsmen in New England; scholarly correspondence among mathematicians at Cambridge University and University of Oxford debated the combinatorial structure and documented the puzzle's constraints.

Description and rules

The standard puzzle is a 4×4 frame holding 15 numbered tiles and one blank space, typically presented in wooden or cardboard sets sold by firms in London and New York City. Legal tournament play and casual challenges mirror demonstrations in clubrooms at Royal Society gatherings and parlor contests in Vienna salons: tiles slide horizontally or vertically into the adjacent blank; diagonal moves are not allowed, and the objective is to arrange tiles into a target ordering exemplified by exhibits at the Smithsonian Institution and displays at the British Museum. Variants used by collectors from Metropolitan Museum of Art and vendors in Florence employ pictorial tiles or alternate goal states but retain the same move set.

Mathematical properties

The configuration space of the puzzle corresponds to a subgroup of the symmetric group studied by researchers at Princeton University and ETH Zurich; combinatorialists referenced works from École Polytechnique and University of Paris to analyze reachable permutations. Graph-theoretic models used by scholars at Massachusetts Institute of Technology and Stanford University represent states as vertices and legal moves as edges, yielding an undirected Cayley-type graph whose diameter—often called the puzzle's "God's number" in analyses at University of Cambridge and Institute for Advanced Study—has been bounded via computational work from teams including researchers affiliated with IBM and Microsoft Research. Connections to group theory, enumerative combinatorics, and topology were explored by mathematicians at Columbia University and University of Chicago.

Solvability and parity

Solvability criteria derive from parity arguments used by Augustin-Louis Cauchy and later formalized in notes circulated among faculty at University of Göttingen and Brown University: a configuration's reachability from the goal state depends on the parity of the tile permutation combined with the blank's row parity relative to the goal. Historical proofs invoked permutation sign considerations familiar to students at Harvard University and Yale University and were popularized in expositions by writers connected with Scientific American and lecturers at Royal Institution. The state space splits into two equal-sized cosets under the alternating subgroup analogs discussed by faculty at University of Cambridge and University of Oxford, making exactly half of all tile arrangements unreachable by legal moves.

Algorithms and solution methods

Practical solution methods range from human heuristics taught in puzzle clubs at Princeton University and Harvard University—such as row-by-row reduction and corner-cycling—to algorithmic approaches developed by teams at Carnegie Mellon University and University of California, Berkeley using A* search with admissible heuristics inspired by research from MIT and Stanford University. Computational optimization and pattern database techniques were advanced by groups at IBM and Microsoft Research; these approaches exploit domain decomposition strategies similar to those in work at Lawrence Berkeley National Laboratory and Los Alamos National Laboratory to prune the search space. Parallel and distributed implementations have been demonstrated by researchers at Cornell University and University of Illinois Urbana-Champaign.

Variants and related puzzles

Related sliding puzzles and generalizations appear in collections at British Museum and private assemblages in Munich: 3×3 versions like the eight-puzzle inspired research at University of Toronto and puzzle designers in Paris, while larger N-puzzles and toroidal sliding puzzles were studied by academics at University of Tokyo and National University of Singapore. Other relatives include the 15-coin puzzle and mechanical sequential puzzles displayed at exhibitions in Florence and Venice; designers from Istanbul and Barcelona have produced pictorial and themed editions. The puzzle continues to inform pedagogical examples in courses at MIT and Stanford University on search algorithms, group theory, and combinatorics.

Category:Mechanical puzzles