X
Learning Advantage 7884 Tower of Hanoi
Learning Advantage 7884 Tower of Hanoi
Learning Advantage 7884 Tower of Hanoi

Learning Advantage 7884 Tower of Hanoi

Product ID : 3068146
4.4 out of 5 stars


Galleon Product ID 3068146
UPC / ISBN 832382008844
Shipping Weight 0.48 lbs
I think this is wrong?
Model 7884
Manufacturer LEARNING ADVANTAGE
Shipping Dimension 7.56 x 3.31 x 2.99 inches
I think this is wrong?
-
Product is Out of Stock as of Jun, 06 2024
Want to monitor availability?
of brand new stock?
or
Need this item ASAP?
Check if this is available on Amazon
or available in other sites
Send us the link so we can buy for you

Pay with

Learning Advantage 7884 Tower of Hanoi Features

  • Handcrafted from durable rubber wood, a high quality hardwood

  • A perfect gift for the collector of intriguing puzzles, mind benders and brainteasers!

  • Tower of Hanoi Size: 7"L x 2.5"W x 3"H

  • Solution key included


About Learning Advantage 7884 Tower Of Hanoi

Tower of Hanoi, also known as The Pagoda Puzzle, is an ancient puzzle that uses repetitive sequential moves for its solution. Seems simple, huh? Here's the kicker. You are allowed to move one piece at a time and are only allowed to place a smaller piece on top of a larger piece. Tower of Hanoi was inspired by a legend that tells of a Hindu temple where the pyramid puzzle might have been used for the mental discipline of young priests. Legend says that at the beginning of time the priests in the temple were given a stack of 64 gold disks, each one a little smaller than the one beneath it. Their assignment was to transfer the 64 disks from one of the three poles to another, with one important provision. A large disk could never be placed on top of a smaller one. Where's the MATH in this game? The number of separate transfers of single disks the priests must make to transfer the tower is 2 to the 64th minus 1, or 18,446,744,073,709,551,615 moves! If the priests worked day and night, making one move every second it would take slightly more than 580 billion years to accomplish the job! You have a great deal fewer disks than 64 here. Can you calculate the number of moves it will take you to move the disks from one of the three poles to another?.