CRX id
eeihhnaeideokodhhgpboicnmbkdaelp
eeihhnaeideokodhhgpboicnmbkdaelp
Description from extension meta
Bring Towers of Hanoi game to your Google Chrome!
Image from store
Description from store
Towers of Hanoi classical puzzle, shift the tower without placing a large piece on a smaller one. A great challenge for smart people!
Play more games on the left-bar menu
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:
- 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 or on an empty rod.
- No 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 2n − 1, where n is the number of disks.
Latest reviews
- (2023-11-04) Joyce Bryan: NICE!!
- (2023-10-04) Capricorn: so amazing!!
- (2023-10-02) Johnny: that's so interesting!!
- (2023-08-26) Gideon Mark: nice 😆
- (2023-08-23) Issac Henry: ok 👍🏻
- (2023-08-01) Lowa Mark: Good but not suitable for me :((((
- (2023-08-01) Bella Julia: Interesting and useful !!
- (2023-07-31) David Bush: It's a great game
- (2023-07-31) Louis Dhara: This game is the best
- (2023-07-30) Grace: i love it!!!
- (2023-07-30) Roy John: love it 😄
- (2023-07-30) Lion Jane: pretty good
- (2023-07-29) Lisa Anne: good 😁
- (2023-07-29) Walker Ethan: Great
- (2022-11-25) Emmet Playz: so hard to play like It doesn't show how and it is very limited too