THanoiTower 2.0.0
THanoiTower is an interactive game to solve Hanoi Tower puzzle. The Tower of Hanoi is a mathematical game. There are three rods and a number of disks with different sizes. The objective is to move the entire stack from one rod to another one.
Last update
30 May. 2019
Licence
Free
OS Support
Windows
Downloads
Total: 337 | Last week: 8
Ranking
#215 in
Puzzles & Logic
Publisher
Tanel
Screenshots of THanoiTower
THanoiTower Publisher's Description
Tower of Hanoi is a mathematical game or puzzle. It is also called as Tower of Brahma that is known as End of Universe game. The earliest recorded reference of Tower of Hanoi is in 1883 from Edouard Lucas who is a French mathematician. The game has interesting story; In the great temple of Brahma in Benares of India, there is a brass plate with three diamond needles under the dome that marks the center of the world. At the creation, God placed 64 discs of pure gold in the order of their sizes, from largest to smallest. This is the Tower of Brahma.
Day and night unceasingly the priests of the temple move the discs from one diamond needle to another according to the fixed and immutable rules listed below;
Only one disc can be moved at a time
A disc can be placed on a larger disc (or no smaller disc below)
Third needle is used temporarily
When the all discs are moved from one needle to another one forming the Tower of Brahma but on a different needle, then will come the end of the universe and all will turn to dust.
If there are n discs on the Tower, minimum of 2n-1 moves are required. Since there are 64 discs in The Tower of Brahma, minimum required moves are 18,446,744,073,709,551,615. At one move per second with the assumption of right moves every time, reforming the Tower with 64 discs will take about;
30,744,573,456,182.58 minutes,
or 512,409,557,603.043 hours,
or 213,503,982,334,601.3 days
or 584,942,417,355.072 years
or 5,849,424,173.55 centuries
Day and night unceasingly the priests of the temple move the discs from one diamond needle to another according to the fixed and immutable rules listed below;
Only one disc can be moved at a time
A disc can be placed on a larger disc (or no smaller disc below)
Third needle is used temporarily
When the all discs are moved from one needle to another one forming the Tower of Brahma but on a different needle, then will come the end of the universe and all will turn to dust.
If there are n discs on the Tower, minimum of 2n-1 moves are required. Since there are 64 discs in The Tower of Brahma, minimum required moves are 18,446,744,073,709,551,615. At one move per second with the assumption of right moves every time, reforming the Tower with 64 discs will take about;
30,744,573,456,182.58 minutes,
or 512,409,557,603.043 hours,
or 213,503,982,334,601.3 days
or 584,942,417,355.072 years
or 5,849,424,173.55 centuries
What's New in Version 2.0.0 of THanoiTower
Added 'Shuffle' function to start playing at a random stage
Added selecting the target rod where all discs to be moved to re-assemble the tower
Added displaying selected time between moves in auto solve mode
Changed auto-update methodology
Minor clean-ups
Win XP is not supported
Added selecting the target rod where all discs to be moved to re-assemble the tower
Added displaying selected time between moves in auto solve mode
Changed auto-update methodology
Minor clean-ups
Win XP is not supported
Look for Similar Items by Category
Feedback
- If you need help or have a question, contact us
- Would you like to update this product info?
- Is there any feedback you would like to provide? Click here
Popular Downloads
- Kundli 4.5
- Macromedia Flash 8 8.0
- Cool Edit Pro 2.1.3097.0
- Hill Climb Racing 1.0
- Cheat Engine 6.8.1
- Grand Theft Auto: Vice City 1.0
- C-Free 5.0
- Windows XP Service Pack 3 Build...
- Iggle Pop 1.0
- Grand Auto Adventure 1.0
- Ulead Video Studio Plus 11
- Zuma Deluxe 1.0
- Netcut 2.1.4
- AtomTime Pro 3.1d
- Tom VPN 2.2.8
- Auto-Tune Evo VST 6.0.9.2
- Horizon 2.9.0.0
- Vidnoz AI 1.0.0
- Vector on PC 1.0
- PhotoImpression 6.5