A recursive solution to the hanoi towers puzzle in c

The following C project contains the C source code and C examples used for a recursive solution to the hanoi towers puzzle. This program implements a C++ solution to the well known "Hanoi Towers Puzzle",this algorithm simply use recursion to solve the puzzle for any given number of disks in the original position (usualy,all the disk are staked on the first peg and there are 3 pegs).

The source code and files included in this project are listed in the project files section, please make sure whether the listed source code meet your needs there.

Project Files: 

File NameSize
Hanoi Towers.cpp 2998
Hanoi Towers.dsp 4358
Hanoi Towers.dsw 549