-40%

Tower of Hanoi 9 Rings Wooden Brain Teaser Puzzle

$ 9.47

Availability: 69 in stock
  • Return shipping will be paid by: Buyer
  • All returns accepted: Returns Accepted
  • Brand: Winshare Puzzles and Games
  • Restocking Fee: No
  • Item must be returned within: 30 Days
  • MPN: 155
  • Condition: New
  • Refund will be given as: Money Back

    Description

    Tower of Hanoi 9 Rings Wooden Brain Teaser Puzzle
    Product Description:
    The Tower of Hanoi (also known asthe Tower of Brahma or Lucas' Tower) is a mathematical game orpuzzle. It consists of three rods, and a number of disks (most common are 7 and9 disks) of different sizes which can slide onto any rod.
    Rules
    The puzzle starts with the disks in a neat stack inascending order of size on one rod, the smallest at the top, thus making aconical shape.
    The objective of the puzzle is to move the entire stackto another rod, obeying the following simple rules:
    1.
    Only one disk can bemoved at a time.
    2.
    Each move consists oftaking the upper disk from one of the stacks and placing it on top of anotherstack i.e. a disk can only be moved if it is the uppermost disk on a stack.
    3.
    No disk may be placedon top of a smaller disk (smaller disks must always be on the top)
    With three disks, the puzzle can be solved in sevenmoves. The minimum number of moves required to solve a Tower of Hanoi puzzle is2
    n
    1, where
    n
    is the number of disks.
    Used often in math classes of differentlevel as well as in computer programming courses.
    Origins
    The puzzle was invented by the French mathematician
    Edouard
    Lucas in 1883. Thereis a story about an Indian temple in
    Kashi
    Vishwanath
    which contains alarge room with three time-worn posts in it surrounded by 64 golden disks.Brahmin priests, acting out the command of an ancient prophecy, have beenmoving these disks, in accordance with the immutable rules of the Brahma, sincethat time. According to the legend, when the last move of the puzzle will becompleted, the world will end. It is not clear whether Lucas invented thislegend or was inspired by it. If the legend were true, and if the priests wereable to move disks at a rate of one per second, using the smallest number ofmoves, it would take them 2
    64
    -1 seconds or roughly585 Billion years, or 18,446,744,073,709,551,615 turns to finish, or about42 times the current age of the Universe.
    There are many legend variations some include Hanoi,Vietnam. which makes this ancient game a mystery.
    This product is the 9 disk version of Tower-of-Hanoi.
    Approximate Diamentions:
    4.0"H x 8.3"L x 3.4"W
    Difficulty Level (1-5):
    4 Hard
    Solution or Instructions Available.
    Return Policy
    Merchandise may be returned for a full refund excluding shipping charges. Merchandise must be returned in its original packaging and in unused and sealed condition and packed sufficiently to avoid being damaged in shipping.
    Please contact us for a Return Authorization number (RMA number)and return instructions, before returning the merchandise.
    Shipping Policy
    We can combine items for discounted shipping, please make sure you are purchasing all items on the same cart and send us a request for total, we'll combine the product price and shipping cost.
    Payment Policy
    We accept PayPal payment. Orders will be shipped once payment is received.