ScienceLAB The Tower Of Hanoi Logic Puzzle - Classroom Set  (Multicolor)

ScienceLAB The Tower of Hanoi Logic Puzzle - Classroom Set ScienceLAB The Tower of Hanoi Logic Puzzle - Classroom Set | Valuable component to a rounded STEM curriculum The Tower of Hanoi Logic Puzzle by Koontz Educational A puzzle of logic, the Tower of Hanoi is also known as the Tower of Brahma and the Lucas Tower puzzle. The ultimate goal of this puzzle is to move an entire stack of disks from one rod to another, recreating it in ascending order. The rules of the puzzle are quite simple: One disk can be moved at a time Only the uppermost disk from any stack can be moved None of the disks can be placed on top of a smaller one Using a simple mathematical equation of 2 n -1, where n is equal to the number of disks in the tower, you can determine the minimum moves required to solve the Tower. This classroom kit contains enough material for 24 individual Tower of Hanoi puzzles, and includes a detailed lesson plan to go with it, as well as instructions on how to assemble the puzzle prior to use. The puzzle has some very interesting origins. It is said to be invented by the mathematician Edouard Lucas in 1883, though there is an ancient legend about a Brahmin monastery somewhere in the depths of the Vietnamese jungles, where Hindi monks are required by a prophecy to transfer the discs from one rod to another. Once all the discs have been moved, the prophecy states that the end of the world will come. Whether Lucas was inspired by this legend to create the Tower of Hanoi, or he invented it the story to generate interest in the puzzle, is unknown. What is known, however, is that based on the mathematical equation mentioned above, it would take 2 64 -1 seconds, or 585 billion years, at a rate of one disc every second, to recreate the 64-disc tower on another rod. How fast can your students solve a Lucas Tower with only 5 discs?