Why you cannot solve the 15-puzzle by swapping 14 and 15: A simple proof

The author of the Habr article provides an accessible explanation of why the classic 15-puzzle becomes unsolvable when the last two tiles (14 and 15) are swapped. Unlike academic proofs that rely on complex group theory, parity of transpositions, and permutation theory, the author offers an intuitive approach that explains the game's mechanics in simple terms. The text examines the logic of tile movement on a 4x4 grid and demonstrates that, given certain initial configurations, reaching the target order is physically impossible. The article is aimed at those who want to understand the mathematical nature of this popular puzzle without diving deep into abstract algebra. The author emphasizes that the probability of success with a random arrangement of tiles is 50%, and the key factor in unsolvability is specifically the order violation in the final row.
This is a summary. Read the full article at the original source:
HabrRelated stories
AOSP Source Releases Are So Late Developers Disassemble Libraries to Report Bugs
Developers working with the Android Open Source Project (AOSP) are expressing significant frustration over the delayed release of source code. Accordi…
Felix Rieseberg, a prominent software engineer known for his contributions to open-source projects and his tenure at companies like Microsoft and Slac…
An end-to-end encrypted task manager built by Claude Code in 19 hours
A developer has introduced Dela, an open-source task manager designed for self-hosting. The project's core feature is end-to-end encryption: all data…


