سورس الگوریتم برج هانوی C++
سورس الگوریتم برج هانوی C++
/*
Sepehr Mohammad
Http://sepehrm.com
Algorithmic solution is as follows
1) if TopN==1, move the single disc from A to C and stop.
2) Move the top n-1 discs from A to B, using C as Inter.
3) Move the remaining disc from A to C.
4)...