Scientifics Online
100% Guaranteed Secured Shopping
You have 0 items in your cart! Total $0.00
View Cart | Wish List | My AccountCHECKOUT
Verisign Secure Site

Sign Up Now For Exclusive Email Offers

Follow @edmundsci on Twitter

Tower of Hanoi Wooden Puzzle



Add To Cart
(Select Quantity Below)

Tower of Hanoi Wooden Puzzle

Take the Challenge! Level 9 Difficulty - Grueling!


The Tower of Hanoi is an ancient puzzle that uses repetitive sequential moves for its solution. The object is to move the tower from one post to another post - but you can only move one disk at a time and you cannot move a big disk on top of a small disk.

There is a legend that talks about an ancient temple which is suppose to have a Tower of Hanoi puzzle, that has 70 disks instead of our 7 disks, in its basement. The legend states that when this puzzle is solved the end of time will occur.

We have been told that if you worked every second of every day all your life you would not be able to solve this puzzle in your life time - are you up for the challenge?



Gift Wrap Available


Item #DescriptionPriceQty
3081157Puzzle, Tower of Hanoi

In stock and ships immediately.
1
2+
$12.95
$11.66





Customer Reviews
Overall Rating:
Rate This and share your thoughts with other customers

Sort Reviews: Newest | Oldest | Highest Rating | Lowest Rating 

 -  Sunday, May 20, 2007
Easier than you think
Reviewed By: Karen (Greenfield, MA)
I first played with a homemade but otherwise identical version of this when I was about 8. I had no problem solving it, and still, 46 years later, when I occasionally see it at a friend's house, can "solve" it in about a minute, or however long it takes to physically move all the pieces. It is NOT a difficult puzzle. It IS fun for children, and for adults who have never seen it, and I am about to purchase two because I want it for one of my young nieces and for my patients with hand injuries to use it to practice grasping and transferring disks of varying sizes. I'm very glad to find it, but I'm highly amused by its difficulty rating!

 -  Tuesday, April 28, 2009
Tower of Hanoi -- Recursion
Reviewed By: Donald  (EasT Lansing, Michigan)
This seemingly simple puzzle is at the heart of the most fundamental principles in computer science: recursion. How can you design a computer program so that you solve the nth step by first solving the n-1th step? There can hardly be a CS student in the world who was not introduced to T of H in a first or second course.

 -  Saturday, December 13, 2008
Awsome
Reviewed By: Josh Sei (Irwin, Pennsylvania)
I loved it.The object is to move the tower.It took me so long to solve it.(About 1 week.) Also use the three poles to your adventure.Great gift for puzzel solvers.


Read More Reviews

 


Edmund Scientifics

Home | Best Sellers | Ed Tech | Free Catalog | My Account
Terms and Conditions | Customer Bill of Rights
Privacy Statement | Contact Us | About Us | How To Order | Site Map

60 Pearce Ave. • Tonawanda, NY 14150
1-800-728-6999 • www.scientificsonline.com

Editors' Choice AwardCelestron Premier Plus Dealer