Tower Of Hanoi_320x480 - Solve the mathematical puzzle TOWER OF HANOI or TOWER OF BRAHMA.
Doesnt matter how educated you are! Solve the mathematical puzzle TOWER OF HANOI or TOWER OF BRAHMA with minimum possible moves. This puzzle was published in
1883 by French mathematician Edouard Lucas. Now its your turn to solve this puzzle with least possible moves. What you have to do is just move all disks from leftmost tower to rightmost.
You have to obey following rules to accomplish the task
1 Only one disk may be moved at a time.
2 You cannot place a larger disk onto a smaller disk.
Like it? Share with your friends!
Supported operating systems:
Java ME, Java Nokia 240x320, Java SE 240x320
Similar Software:
Pile Up! This game won the popularity in the Internet long time ago, it was played by more than 25 million people in total! It comes to your mobiles now. Put three same colored balls together to make them disappear. Collect bonuses and enjoy unbelievably realistic physics of the game. The balls will roll from the pile just as real peas
Puzlik Lite Puzlik is a board game known as jigsaw
Same Hearts Try to remove the connected hearts of the same color
Musik quiz 2 What do you know about music? Try to give answers to the easiest and the hardest questions about music
Knights Tour (Java) A logic puzzle based on the moves of the Knight in Chess
Jigsaw With Spider Man (360x640) Are you fond of solving puzzles? Download this FREE JAVA app to rearrange the scattered image - Spider Man and see your capability of solving puzzles
Jeweleon You like puzzles but it is boring to play alone? Then download a new absolutely free online version three-in-line for two players! Now you can play with real opponents from all over the world! Here is a clue especially for you: first make a bigger score than your opponent, second finish the game before you start loosing your positions
