Project 15 Puzzle · Solving the Original Configuration

Lesson 1

Nikolai Chukhin · Alexander S. Kulikov

In this section, we prove that exchanging \(14\) and \(15\) in the 15 Puzzle is impossible. To do this, we will be looking at permutations of integers \(\{0, 1, \dotsc, n-1\}\) and we assume that they are indiced by the same integers. A transposition in a permutation \(\pi\) is an exchange of two different elements of \(\pi\).

It will prove convenient to denote the transposition above by \((1, 3)\), that is, by the pair of indices of two elements it swaps.