6.19.2008
The Tower of Hanoi
>
French mathematician Edouard Lucas came up with the Tower of Hanoi. You must move a series of disks from a left pole to a right pole, going one at a time - and each disk must fit on top of a larger disk. With 4 disks, it's fairly easy. With 7 disks, challenging and prone to distraction.
But remember, math operations are always simple in essence, requiring repetition and focus on each component in order to solve correctly.
This exercise also may light up the brain. Reaction time is not important, rather, it's logic and problem solving ability - working a different part of your brain.
But remember, math operations are always simple in essence, requiring repetition and focus on each component in order to solve correctly.
This exercise also may light up the brain. Reaction time is not important, rather, it's logic and problem solving ability - working a different part of your brain.
Labels: hanoi, lucas, recursive+algorithm, tower, tower+of+hanoi
