The 15 puzzle (also called Gem Puzzle, Boss Puzzle, Game of Fifteen, Mystic Square and many others) is a sliding puzzle having 15 square tiles numbered 1–15 in a frame that is 4 tiles high and 4 tiles wide, leaving one unoccupied tile position. Tiles in the same row or column of the open position can be moved by sliding them horizontally or vertically, respectively. The goal of the puzzle is to place the tiles in numerical order.
Named for the number of tiles in the frame, the 15 puzzle may also be called a 16 puzzle, alluding to its total tile capacity. Similar names are used for different sized variants of the 15 puzzle, such as the 8 puzzle that has 8 tiles in a 3×3 frame.
The n puzzle is a classical problem for modelling algorithms involving heuristics. Commonly used heuristics for this problem include counting the number of misplaced tiles and finding the sum of the taxicab distances between each block and its position in the goal configuration. Note that both are admissible, i.e. they never overestimate the number of moves left, which ensures optimality for certain search algorithms such as A*.
Johnson & Story (1879) used a parity argument to show that half of the starting positions for the n puzzle are impossible to resolve, no matter how many moves are made. This is done by considering a function of the tile configuration that is invariant under any valid move, and then using this to partition the space of all possible labeled states into two equivalence classes of reachable and unreachable states.
The invariant is the parity of the permutation of all 16 squares plus the parity of the taxicab distance (number of rows plus number of columns) of the empty square from the lower right corner. This is an invariant because each move changes both the parity of the permutation and the parity of the taxicab distance. In particular, if the empty square is in the lower right corner then the puzzle is solvable if and only if the permutation of the remaining pieces is even.
Johnson & Story (1879) also showed that the converse holds on boards of size m×n provided m and n are both at least 2: all even permutations are solvable. This is straightforward but a little messy to prove by induction on m and n starting with m=n=2. Archer (1999) gave another proof, based on defining equivalence classes via a hamiltonian path.
Wilson (1974) studied the generalization of the 15 puzzle to arbitrary finite graphs, the original problem being the case of a 4×4 grid graph. The problem has some degenerate cases where the answer is either trivial or a simple combination of the answers to the same problem on some subgraphs. Namely, for paths and polygons, the puzzle has no freedom; if the graph is disconnected, only the connected component of the vertex with the "empty space" is relevant; and if there is an articulation vertex the problem reduces to the same puzzle on each of the biconnected components of that vertex. Excluding these cases, Wilson showed that other than one exceptional graph on 7 vertices, it is possible to obtain all permutations unless the graph is bipartite, in which case exactly the even permutations can be obtained. The exceptional graph is a regular hexagon with one diagonal and a vertex at the center added; only 1/ of its permutations can be attained.
For larger versions of the n puzzle, finding a solution is easy, but the problem of finding the shortest solution is NP-hard. It is also NP-hard to approximate the fewest slides within an additive constant, but there is a polynomial-time constant-factor approximation. For the 15 puzzle, lengths of optimal solutions range from 0 to 80 single-tile moves (there are 17 configurations requiring 80 moves) or 43 multi-tile moves; the 8 puzzle always can be solved in no more than 31 single-tile moves or 24 multi-tile moves (integer sequence A087725). The multi-tile metric counts subsequent moves of the empty tile in the same direction as one.
The number of possible positions of the 24 puzzle is 25!/ ≈ 7.76×1024 which is too many to calculate God's number. In 2011, lower bounds of 152 single-tile moves or 41 multi-tile moves had been established, as well as upper bounds of 208 single-tile moves or 109 multi-tile moves. In 2016, the upper bound was improved to 205 single-tile moves.
Because the combinations of the 15 puzzle can be generated by 3-cycles, it can be proved that the 15 puzzle can be represented by the alternating group . In fact, any sliding puzzle with square tiles of equal size can be represented by .
In an alternate view of the problem, we can consider the invariant to be the sum of the parity of the number of inversions in the current order of the 15 numbered pieces and the parity of the difference in the row number of the empty square from the row number of the last row. (Let's call it row distance from the last row.) This is an invariant because each column move, when we move a piece within the same column, changes both the parity of the number of inversions (by changing the number of inversions by ±1, ±3) and the parity of the row distance from the last row (changing row distance by ±1); and each row move, when we move a piece within the same row, does not change any of the two parities. Now if we look at the solved state of the puzzle, this sum is even. Hence it is easy to prove by induction that any state of the puzzle for which the above sum is odd cannot be solvable. In particular, if the empty square is in the lower right corner (even anywhere in the last row) then the puzzle is solvable if and only if the number of inversions of the numbered pieces is even.
The puzzle was "invented" by Noyes Palmer Chapman, a postmaster in Canastota, New York, who is said to have shown friends, as early as 1874, a precursor puzzle consisting of 16 numbered blocks that were to be put together in rows of four, each summing to 34. Copies of the improved Fifteen Puzzle made their way to Syracuse, New York, by way of Noyes' son, Frank, and from there, via sundry connections, to Watch Hill, Rhode Island, and finally to Hartford (Connecticut), where students in the American School for the Deaf started manufacturing the puzzle and, by December 1879, selling them both locally and in Boston, Massachusetts. Shown one of these, Matthias Rice, who ran a fancy woodworking business in Boston, started manufacturing the puzzle sometime in December 1879 and convinced a "Yankee Notions" fancy goods dealer to sell them under the name of "Gem Puzzle". In late January 1880, Dr. Charles Pevey, a dentist in Worcester, Massachusetts, garnered some attention by offering a cash reward for a solution to the Fifteen Puzzle.
The game became a craze in the U.S. in 1880.
Noyes Chapman had applied for a patent on his "Block Solitaire Puzzle" on February 21, 1880. However, that patent was rejected, likely because it was not sufficiently different from the August 20, 1878 "Puzzle-Blocks" patent (US 207124) granted to Ernest U. Kinsey.
Sam Loyd claimed from 1891 until his death in 1911 that he invented the puzzle, for example writing in the Cyclopedia of Puzzles (published 1914): "The older inhabitants of Puzzleland will remember how in the early seventies I drove the entire world crazy over a little box of movable pieces which became known as the '14-15 Puzzle'."[failed verification] However, Loyd had nothing to do with the invention or initial popularity of the puzzle, and in any case, the craze was in 1880, not the early 1870s. Loyd's first article about the puzzle was published in 1886 and it was not until 1891 that he first claimed to have been the inventor.
Some later interest was fuelled by Loyd offering a $1,000 prize for anyone who could provide a solution for achieving a particular combination specified by Loyd, namely reversing the 14 and 15, called by Loyd the 14-15 puzzle. This was impossible, as had been shown over a decade earlier by Johnson & Story (1879), as it required a transformation from an even to an odd permutation.
- Combination puzzles
- Jeu de taquin, an operation on skew Young tableaux similar to the moves of the 15 puzzle
- Mechanical puzzles
- Pebble motion problems
- Rubik's Cube
- Three cups problem
- Korf, R. E. (2000), "Recent Progress in the Design and Analysis of Admissible Heuristic Functions" (PDF), in Choueiry, B. Y.; Walsh, T. (eds.), Abstraction, Reformulation, and Approximation (PDF), SARA 2000. Lecture Notes in Computer Science, vol. 1864, Springer, Berlin, Heidelberg, pp. 45–55, doi:10.1007/3-540-44914-0_3, ISBN 978-3-540-67839-7, retrieved 2010-04-26
|volume=has extra text (help)
- Daniel Ratner, Manfred K. Warmuth. Finding a Shortest Solution for the N × N Extension of the 15-PUZZLE Is Intractable. National Conference on Artificial Intelligence, 1986.
- Ratner, Daniel; Warmuth, Manfred (1990). "The (n2−1)-puzzle and related relocation problems". Journal of Symbolic Computation. 10 (2): 111–137. doi:10.1016/S0747-7171(08)80001-6.
- Richard E. Korf, Linear-time disk-based implicit graph search, Journal of the ACM Volume 55 Issue 6 (December 2008), Article 26, pp. 29-30. "For the 4 × 4 Fifteen Puzzle, there are 17 different states at a depth of 80 moves from an initial state with the blank in the corner, while for the 2 × 8 Fifteen Puzzle there is a unique state at the maximum state of 140 moves from the initial state."
- A. Brüngger, A. Marzetta, K. Fukuda and J. Nievergelt, The parallel search bench ZRAM and its applications, Annals of Operations Research 90 (1999), pp. 45–63.
:"Gasser found 9 positions, requiring 80 moves...We have now proved that the hardest 15-puzzle positions require, in fact, 80 moves. We have also discovered two previously unknown positions, requiring exactly 80 moves to be solved."
- "The Fifteen Puzzle can be solved in 43 "moves"". Domain of the Cube Forum
- "24 puzzle new lower bound: 152". Domain of the Cube Forum
- "m × n puzzle (current state of the art)". Sliding Tile Puzzle Corner.
- "208s for 5x5". Domain of the Cube Forum.
- "5x5 can be solved in 109 MTM". Domain of the Cube Forum.
- "5x5 sliding puzzle can be solved in 205 moves". Domain of the Cube Forum.
- Jim Belk (2008) Puzzles, Groups, and Groupoids, The Everything Seminar
- The 15-puzzle groupoid (1), Never Ending Books
- The 15-puzzle groupoid (2), Never Ending Books
- Beeler, Robert. "The Fifteen Puzzle: A Motivating Example for the Alternating Group" (PDF). faculty.etsu.edu/. East Tennessee State University. Retrieved 26 December 2020.
- The 15 Puzzle, by Jerry Slocum & Dic Sonneveld, 2006. ISBN 1-890980-15-3
- Slocum & Singmaster (2009, p. 15)
- Cyclopedia of Puzzles, p. 235
- Barry R. Clarke, Puzzles for Pleasure, pp.10-12, Cambridge University Press, 1994 ISBN 0-521-46634-2.
- Archer, Aaron F. (1999), "A modern treatment of the 15 puzzle", The American Mathematical Monthly, 106 (9): 793–799, CiteSeerX 10.1.1.19.1491, doi:10.2307/2589612, ISSN 0002-9890, JSTOR 2589612, MR 1732661
- Johnson, Wm. Woolsey; Story, William E. (1879), "Notes on the "15" Puzzle", American Journal of Mathematics, 2 (4): 397–404, doi:10.2307/2369492, ISSN 0002-9327, JSTOR 2369492
- Edward Kasner & James Newman (1940) Mathematics and the Imagination, pp 177–80, Simon & Schuster.
- Slocum, Jerry; Singmaster, David (2009). The Cube: The Ultimate Guide to the World's Best-Selling Puzzle—Secrets, Stories, Solutions. Black Dog & Leventhal. ISBN 978-1579128050.
- Wilson, Richard M. (1974), "Graph puzzles, homotopy, and the alternating group", Journal of Combinatorial Theory, Series B, 16: 86–96, doi:10.1016/0095-8956(74)90098-7, ISSN 0095-8956, MR 0332555
|Wikimedia Commons has media related to 15 puzzle.|
- The history of the 15 puzzle
- Fifteen Puzzle Solution
- Maximal number of moves required for the m X n generalization of the 15 puzzle
- 15-Puzzle Optimal Solver with download (from Herbert Kociemba)