tower of hanoi program in c using graphics in multimedia

The puzzle was invented by the French mathematician Édouard Lucas in 1883. 4.4 General shortest paths and the number 466/885.2.2.1 Logical analysis of the recursive solution.

2.1.1 Simpler statement of iterative solution.The minimal number of moves required to solve a Tower of Hanoi puzzle is 2 n − 1, where n is the number of disks. With 3 disks, the puzzle can be solved in 7 moves. No disk may be placed on top of a disk that is smaller than it.Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack or on an empty rod.The objective of the puzzle is to move the entire stack to the last rod, obeying the following rules:

The puzzle begins with the disks stacked on one rod in order of decreasing size, the smallest at the top, thus approximating a conical shape. The Tower of Hanoi (also called The problem of Benares Temple or Tower of Brahma or Lucas' Tower and sometimes pluralized as Towers, or simply pyramid puzzle ) is a mathematical game or puzzle consisting of three rods and a number of disks of various diameters, which can slide onto any rod. Tower of Hanoi interactive display at Mexico City's Universum Museum

Tower of hanoi program in c using graphics in multimedia