There are three poles and 64 discs of different sizes. Initially, all the discs are placed on the first pole with the largest disc at the bottom and the smallest one at the top. We need to move all the discs from the first pole to the third pole, with the smallest disc at the top and the largest at the bottom. We can move only one disc at a time (which should be the topmost disc) and at any point of time, a larger disc cannot be placed over a smaller one i.e.

• Give More Feedback
• Tower Of Hanoi In C Programming

All the discs on a pole must be placed in such a way that the smallest is at the top and the largest at the bottom. The second pole can be used as an intermediate pole to help us in transferring the discs.

Give More Feedback

C Program To Solve Tower of Hanoi without Recursion Learn How To Solve Tower of Hanoi without Recursion in C Programming Language. This Non Recursive C Program makes use of an Iterative method using For Loop to solve Tower of Hanoi Problem. The Tower of Hanoi Algorithm in Data Structures is a very famous Interview Question for Beginners. The C Program For Tower of Hanoi Program using Iteration can be solved by using For, While and Do While Loop. To know more about Tower of Hanoi, you can read this guide. 5 thoughts on “ Tower of Hanoi without Recursion C Program”.

Solving the Tower of Hanoi using recursion. Java Program: public class. Understanding the recursive Hanoi algorithm using a concrete example.

c programmer Here’s another method to solve the Tower of Hanoi puzzle. It’s a mechanical solution which doesn’t use recursion. Cannibal holocaust 2 rapidshare. Try it out using 3 or 4 coins of different sizes.

Arrange the three rods to form a triangle. Starting position (where X, Y and Z are different size coins): empty rod Z YYY XXXXX starting rod destination rod Finished position: empty rod Z YYY XXXXX starting rod destination rod Move the smallest disk on every other turn — always in the same direction. On the remaining turns make the only valid move that does not involve the smallest disk. The following rule will make sure that the tower of disks end up on the third rod: If the number of disks in the puzzle is an odd number then always move the smallest disk counter-clockwise around the triangle; if the number of disks in the puzzle is an even number then always move the smallest disk clockwise around the triangle.

Tower Of Hanoi In C Programming

With this solution the even numbered disks move around the triangle in one direction while the odd numbered disks move around the triangle in the opposite direction.