Free Math Games
Logic Games
Free Economic Games


p42 astronomy icon p42 biology icon p42 geography icon p42 mathematics icon p42 chemistry icon p42 computers icon p42 physics icon p42 languages icon p42 arts icon p42 archeology icon


Back Classic Logic Logic Puzzle Games Logic Figures Logic Riddles Paper and Pencil Intelligence Quotients Tests Logic Boards Next

twitter  

g g

Play Tower of Hanoi Online.

"Tower of Hanoi" is a free online logic game to resort movable rings on different pins. Play Tower of Hanoi online on computer. Classic logic game. Fun logic learning game. Move all rings from one side to another.

This fun logic game include the following regimes:
  • 3 rings game - easiest.
  • 5 rings game.
  • 6 rings game.
  • 8 rings game.
  • 10 rings game - hardest.
Tower of Hanoi Picture

a a


m m

How to play Tower of Hanoi.

This is a classic Hanoi Tower game made by Fupa.com. The player must move a number of rings from one pi (tower) to another in the same order. Detailed rules are described in the Class subjects section.

Knowledge Achievements:
Know how to win a Tower of Hanoi game.
Difficulty: Medium.

Tower of Hanoi Screenshot

e e

s s

Class subject: Tower of Hanoi Game Rules:

The Tower of Hanoi (also called the Tower of Brahma or Lucas' Tower and sometimes pluralized) is a mathematical game or puzzle. It consists of three rods and a number of disks of different sizes, which can slide onto any rod. The puzzle starts with the disks in a neat stack in ascending order of size on one rod, the smallest at the top, thus making a conical shape.

The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules: 1. Only one disk can be moved at a time. 2.Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack or on an empty rod. 3. No larger disk may be placed on top of a smaller disk.

With 3 disks, the puzzle can be solved in 7 moves. The minimal number of moves required to solve a Tower of Hanoi puzzle is 2(exponent)n ? 1, where n is the number of disks.

Here is how to solve Hanoi Tower:

p42 p42


Comments (Blogger)

Download

Back Up Next


p42 psychology icon p42 history icon p42 economics icon p42 cooking icon p42 logic icon p42 sports icon p42 greeting cards icon p42 nature puzzles icon p42 movie puzzles icon p42 game puzzles icon
 
Labels: , , , , ,
Planeta 42 Game World | About | Sitemap | Levels | Downloads | News | Free Games | Drawings | Best Games Ever