Mo logo [home] [lexicon] [problems] [tests] [courses] [auxiliaries] [notes] [staff] german flag
Mathematik-Online problems:

Problem 89: Sliding Block Puzzle

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
A sliding block puzzle consists of 24 numerated parts in a box of $ 5\times 5$ squares. One of the squares keeps empty. Adjoining pieces can be moved vertical or horizontal onto the empty square. The puzzle is called solvable, if it's possible to transform it into the starting configuration $ A$ by a finite sequence of movements.

\includegraphics[width=13.5cm]{g38_bild1}
Show that none of the puzzles $ B$ and $ C$ is solvable.

(Authors: Kimmerle/Höfert)

Solution:

[Links]
  automatisch erstellt am 14. 10. 2004