Towers of Hanoi

This week we went over the concept behind the Towers of Hanoi. The only back ground information I have on them is the version of the puzzle I played as a kid. The most efficient number of moves was definitely not the main goal - instead simply moving all the rings was the objective. 

With more of an in depth look at them, concept behind the Towers of Hanoi to be really interesting.  It is one big logic puzzle, very similar to programming.It also reminds me of programming in the sense that you are trying to complete the given problem in the most efficient way (i.e.: least amount of code) and in the least amount of time (similarly to how programmers want to run the most efficient code). 

I took the time to read up on the background of the Tower of Hanoi puzzle. The most basic way to solve the puzzle requires 2^(n-1) moves, n being the number of rings. This how ever does not provide the most efficient way to move the rings. The most interesting part is that there is no actual formula to provide the most efficient way to move all the rings. 

There are Ph.d level scholar articles written about proving the most efficient way to move the rings. It will be interesting to see how completing this assignment will give me more insight in regards to the Tower of Hanoi.