The 15-puzzle of Sam Loyd

The 15-puzzleis a sliding puzzle that consists of a frame of numbered square tiles in random order with one tile missing. Starting from the initial position of pic.1 we apply a finite number of planar reordering in such way that the bottom right square is not filled.

Diagram2

Every such reordering is a permutation of {1,2,…,15} , which is an element of S_{15}. So the set G of all the permutations is a group of order 15.

The reordering is done by the means of the altering permutations (i,j) like pic.2

15_puzzle

Which are all the possible re orderings ? The answer is that G is equal to the group of even permutations. So G\leq A_{16}\cap S_{15} = A_{15}

nice one from here .Even if you don t like geometry problems , you should give it a try 🙂

PROBLEM :

What is the largest number of regions  r(n) that a plane is divided into by n  straight lines in the plane?
Give r(n) as a function of n and explain why your answer is correct.