Tower of Hanoi
- Categoría: Puzzles Games
- Licencia: Freeware
- Tamaño: < 1 KB
- Sistema: wXP Vista w7 w8
- Idiomas:
How many moves do you need to get the rings from one pile to another?
Tower of Hanoi is the computer version of the popular puzzle invented by the French mathematician Edouard Lucas in 1883, and is commonly used in many textbooks as an introduction to the theory of algorithms.
In Tower of Hanoi you'll find a board consisting of 3 vertical poles, on one of which you can see rings of decreasing size. The objective of this puzzle is to form the same pile on the pole at the other end, following some simple rules. You can't move more than 1 ring at the same time, and a ring can not be placed on one that's smaller.
The challenge is to complete the task of reproducing the stack of rings on another pole, but using as few moves as possible. Would you like to try? Think you can become part of the top rated players in Tower of Hanoi?
Download
