Here is one of the older sliding puzzles:

You have a sliding puzzle that looks like this:

AB
 C
DE

You may move a block with a letter on it to the blank space by sliding it there. How many moves does it take to put D where E is and E where D is at the same time? (The other pieces don't need to be in their original spots.)

(In reply to 10 moves! by GOM)

The original problem states the other pieces don;t need to be in their original positions.

If A, B, and C had to be in their respective places, then the puzzle would be unsolvable.

Posted by Erik O. on 2004-06-10 08:30:55