文件名称:hannuo.tower.example
介绍说明－－下载内容均来自于网络，请自行研究使用
游戏算法思路：
1.如果只有一个金片，则把该金片从源移动到目标棒，结束。
2.如果有n个金片，则把前n-1个金片移动到辅助的棒，然后把自己移动到目标棒，最后再把前n-1个移动到目标棒
-Game algorithm ideas: 1. If there is only one gold, took the gold from the source to the target mobile wand to end. 2. If there is n-gold, while the former n-1 gold piece to move to supporting rods, and then move to the goal of their own bar, the last before the n-1 and then moving to the target rod
1.如果只有一个金片，则把该金片从源移动到目标棒，结束。
2.如果有n个金片，则把前n-1个金片移动到辅助的棒，然后把自己移动到目标棒，最后再把前n-1个移动到目标棒
-Game algorithm ideas: 1. If there is only one gold, took the gold from the source to the target mobile wand to end. 2. If there is n-gold, while the former n-1 gold piece to move to supporting rods, and then move to the goal of their own bar, the last before the n-1 and then moving to the target rod
相关搜索： rod
(系统自动生成,下载前可以参看下载内容)
下载文件列表
C++例程汉诺塔.cpp