Description: N If a plate (small to large) a through b, moved to c, the removal process can not appear in a small dish platter the following scenario. This a recursive problem. As long as the n-1 a plate a (certainly not without an intermediate point) move b by c, then the n-th plate a move to c, and finally the n-1 plate b through a move c. Solve with C++.
To Search:
File list (Check if you may need any files):
汉诺塔问题中的栈状态及递归执行层次.cpp
汉诺塔问题及其解决.c
汉诺塔问题.cpp
Download