This version consists of three squares and a number of tiles of different sizes, which can move into any square. The puzzle starts with the tiles in a neat stack in ascending order of size in the first square. The smallest is on the top, thus making a conical shape.
The objective of the puzzle is to move the entire stack of tiles from one square to another, obeying the following simple rules:
(i) Only one disk can be moved at a time. (ii) Each move consists of taking the upper tile from one of the squares and placing it on top of another tile i.e. a tile can only be moved if it is the uppermost tile on a stack. (iii) No tile may be placed on top of a smaller tile.
|
|
|
|
|