5.24.2010
Can you solve the Tower of Hanoi? Again
>
Back to posting...The other day I solved the Tower of hanoi in 6 moves - since 7 is the minimum, this classifies as a possible breakthrough if it can be replicated.
As suspected, many dissertations in theoretical mathematics have been completed on the tower of hanoi, defined by the French mathematician Edouard Lucas in 1883 as a splendid example of a recursive algorithm.
Give it a try and see what you can do - on the Cognitive Labs site. Scroll and locate here. The best I've ever done before is the typical seven moves.
As suspected, many dissertations in theoretical mathematics have been completed on the tower of hanoi, defined by the French mathematician Edouard Lucas in 1883 as a splendid example of a recursive algorithm.
Give it a try and see what you can do - on the Cognitive Labs site. Scroll and locate here. The best I've ever done before is the typical seven moves.
Labels: hanoi
