搜索资源列表
汉诺塔的演示程序
- 初学MFC时的拙作，一个汉诺塔的演示程序，采用非递归、非堆栈的算法，直接根据当前步数推算出汉诺塔的状态。界面用GDI实现，伪3D的风格。-beginners at the exposition, a HANOR the demo program, the use of non - recursive and non-stack algorithm, directly under the current steps are projected HANOR state. GDI interface
一个汉诺塔程序
- 重演经典的汉诺塔。 做课程设计时做的，不算太好，呵呵…… 不过还算基本规范吧。适合初学者。-repeat of the classic Tower of Hanoi. Courses designed to do so, not too good, huh ... but it still basic norms. For beginners.
汉诺塔1
- 汉诺塔游戏演示过程-HANOR game demonstration
汉诺塔问题的C#实现
- 利用递归算法实现了汉诺塔问题的求解步骤
汉诺塔
- 该文件是下了汉诺塔算法，采用的是VB语言，效果很好
hannuota
- 用Csharp写的一个汉诺塔程序源代码，相信对初学者很有帮助-CSharp write with a Tower of Hanoi program source code, I believe very helpful for beginners
hanoi-vb
- 自编vb汉诺塔小程序，可直接在vb下运行-Vb own Tower of Hanoi applet can be run directly in vb
hannuota
- 汉诺塔游戏源代码，汉诺塔游戏是把塔1上的碟子移动到塔2上去，其间借助于塔3的帮助。每次只能移动一个碟子，另外，任何时候都不能把一个碟子放在比它小的碟子上面。-Tower of Hanoi game source code, the game is the Tower of Hanoi Tower 1 on the plate 2 to move to the tower go up, which means the help of Tower 3. Each can only move one
1
- 小程序来的，是关于汉诺塔游戏问题的小程序-Small procedures is on the issue of Tower of Hanoi game applet
hanoi4
- 汉诺塔的演示！详细演示了汉诺塔的移动过程，盘子个数可以用1个到9个，建议用5个左右效果较好-Tower of Hanoi demo! Tower of Hanoi demonstrated in detail the movement of the process, the plate number can be 1-9, it is recommended to use about 5 better
hanoi
- 汉诺塔游戏，很简单的。我做的一次课程设计-Tower of Hanoi game, very simple. I do a course design
han_nuo
- 汉诺塔的简单实现，界面显示，操作。小游戏-the game of hannuo tower
hanno
- 简单的汉诺塔程序 用于的动态显示 排列过程-Simple Tower of Hanoi program arranged for the dynamic display during
1
- 汉诺塔问题的解决，C++递归实现汉诺塔问题(Solving Hanoi problem)
汉诺塔课设
- 实现汉诺塔的设计，适合C++新手对递归函数的理解与掌握(The design of hannotta is suitable for the understanding and mastery of the recursive function of the novice c + +)
3-汉诺塔
- 本人我用C++语言写的一个简单的汉诺塔的程序，这个程序很简单，不喜勿喷。(I have written a simple hannotta program in c ++ language, which is simple and not to be liked.)
汉诺塔托盘问题
- 输入原始A柱上的盘子数，即可得到移动到目标柱子的步骤和所需步数(enter the disks of initial A column and you can get the procedures which you need to move the disks to the target column)
数据结构-汉诺塔-实验报告
- 1.1 实验目的及要求 设计数据结构表示3座宝塔和n个碟子： 输出每一次移动碟子的情况 分析算法的时间性能 1.2 实验设计 1；将塔A上的n-1个碟子借助塔C移动到塔B上 2：把塔A上剩下的一个碟子移动到塔C上 3：将n-1个碟子从塔B借助于塔A移到塔C上 三座宝塔（塔A,塔B,塔C）分别用三个字符型变量A，B，C表示，n个碟子从1 开始连续自然数编号(1.1 the purpose and requirements of the experiment The desig
java课程设计--Hannoi汉诺塔游戏
- 汉诺塔小游戏功能实现，游戏分为初，中，高难度。背景盘子颜色可以设置。(Tower of Hanoi game function, the game is divided into early, high difficulty. The color of the background plate can be set. Hannoi)
汉诺塔
- 这是一个简单的C++程序，代码清晰，程序可读性强，不断学习中。汉诺塔源程序(This is a simple C++ program, code clarity, program readability, continuous learning. HANOR source)