# Rigorous proof to show that the $15$-Puzzle problem is unsolvable

So this is supposedly a very popular puzzle by Sam Loyd. (I don't want answerers to provide solutions directly from some website etc. I mean, an ingenious solution is more welcome please.) Now, as you see all numbers are arranged in ascending order except the last two. The rule of the game is to move a numbered block which is adjacent to the blank space and create another blank place in its original position (I mean, you just shift the position of blank space around by sliding the numbers around) .

Now the question goes as, can you arrange all the numbers in the correct ascending order? (The final outcome would be just interchange the positions of $15$ and $14$).

I know of a solution using a very clever trick of invariance (the invariant seemed quite non-trivial to me ;-P). Can others here come up with some interesting solutions?

• So this is just a 15-puzzle? Mar 30, 2018 at 14:49
• @ericw31415 I don't know if it's just a... but it seemed quite interesting and the mathematics behind it didn't seem just trivial to me ... Mar 30, 2018 at 14:50
• this puzzle is impossible to solve Mar 30, 2018 at 14:51
• Every move swaps the blank space with an adjacent block. In the end the blank space must return to its original position, but this requires an even number of moves. Now consider the parity of the desired permutation.
– user856
Mar 30, 2018 at 15:09
• It's not just "a" 15-puzzle. It is "the" 15-puzzle. Very well known. Should read up on it. en.wikipedia.org/wiki/15_puzzle Upshot. All even permutations are solveable and all odd permutations are not. This is an odd permutation. Mar 30, 2018 at 15:09