The Tower of Hanoi is a mathematical puzzle that consists of three rods and a number of disks of many different sizes. You have all the disks to the last rod on the right without putting a bigger disk on top of a smaller disk.
These are the rules:
1. Only one disk can be moved at a time.
2. Each move consists of taking the upper disk from one of the stacks and placing it on top of another disk.
3. No disk may be placed on top of a smaller disk.
This puzzle was created by the French Mathematician Edouard Lucas in 1883. However, there is a story in Indian temple in Kashi Vishawanath that there is a large room with three worn posts surrounded by 64 golden disks. There is a prophecy where when the puzzle is solved and the last move of the puzzle the piece is complete, the world will end. This sounds fake and somewhat frightening, however, it would take some time till then.
It would take 585 billion years to actually finish this puzzle of moving all 64 pieces. It would take 18,446,744,073,709,551,615 moves to actually finish this at a minimum moves possible.
The puzzle is 2^n -1 where n is the number of disks. That is how you solve it.
In class today, we used mathematical induction to solve this and using an app to understand mathematical induction through the tower of hanoi. That is what we did this week.
Here is a picture on how we solved it.
SEE YOU NEXT WEEK!!!
No comments:
Post a Comment