Recent content by ashoka

I have included the solution for 4 tower case. Please have a look http://iq-games.blogspot.com/2011/04/towers-of-hanoi-part-8.html" . Havn't seen this algorithm before anywhere, if any of you have seen it, please let me know. Also in part 4,5 and 6 you will see the solution (in java) for...

Your solution can actually be improved. rather than building a tower of 8 in the second tower, you could build a tower of size 5 there. then put next 4 biggest rings in tower 3 and finally move the biggest ring to the target tower. This way it will take you only 49 steps. Thus the formula given...