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 minimal number of moves required to solve a Tower of Hanoi puzzle is 2n 1, where n is the number of disks.in this game we add more levels up to 7 disk
Test your intelligence by playing Towers of Hanoi. The game consists in changing the discs tower 1 to tower 3 on the condition that you can not move more than one disc at a time, and can not put a large disk on a small one.- Only one disk can be moved at a time.- Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack - No disk may be placed on top of a smaller disk.
Dangerously addictive Join the worlds new puzzle craze now LOLO is a highly addictive block puzzle game. Gather same color shapes into a single cell. Try the ENDLESS MODE to RELAXFeatures:- Easy & intuitive gameplay- Colorful puzzle game for all ages- No life limits- Check out your friends scores - Worldwide high score rankings- Nice design and beautiful colors Enjoy LOLO