| Tower of Hanoi is a complex tape backup strategy that's useful for archiving data for an extended period of time in an economical manner. Archives consist of older data that is still important and necessary for future reference, as well as data that must be retained for regulatory compliance. Data archives are also indexed and have search capabilities so that files and parts of files can be easily located and retrieved. The Tower of Hanoi backup strategy is based on a mathematical puzzle invented by the French mathematician Edouard Lucas, which uses a cycle of exponential retention periods instead of a large number of tapes. Lucas, who is well-known for his study of the Fibonacci sequence and his work with prime numbers, loved recreational mathematics. His Tower of Hanoi puzzle, which is still marketed as a toy for children, has a platform with three poles. There is a stack of disks or rings on the first pole. The stack looks like a pyramid; each disk going down the pole is a little larger than the one above it. 
To solve Lucas' puzzle, the player must move all the discs from the first pole to the third pole in the fewest possible moves. There are two rules: only one disk can be moved at a time and a larger disc can not be placed on top of a smaller one. The puzzle requires a recursive solution in which the information gained from one step is used to figure out the next step. There are several ways to solve the puzzle, but one of the easiest ways is to start with only one ring -- and then figure out how to solve it with two rings -- and then figure out how to solve it with three rings. Once you have solved the puzzle using small numbers, patterns will begin to emerge. Continue reading...
| 
Posts
No comments:
Post a Comment