Location:
Search - Hanno
Search list
Description: 这是用VB 开发的一个汉诺塔程序-This is a development of the VB HANOR procedures
Platform: |
Size: 7597 |
Author: 李博 |
Hits:
Description: 自制汉诺塔自动演示,不足之处敬请各位指教-HANOR automatic homemade demo shortfall Department locations to enlighten
Platform: |
Size: 10966 |
Author: pdafan |
Hits:
Description: 用C编的hanno塔-C series Hanno tower
Platform: |
Size: 1650 |
Author: 独孤笑 |
Hits:
Description: 这是一个关于汉诺塔的程序，介绍了关于汉诺塔的操作
Platform: |
Size: 2205 |
Author: igeit |
Hits:
Description: 这是一个汉诺塔游戏的原代码,tc环境.可是图型界面的哦~~,不要认为是一般的递归了!-HANOR the original game code, tc environment. However, the map-based interface ~ ~ Oh, do not believe that the general recursion!
Platform: |
Size: 5787 |
Author: 张秋水 |
Hits:
Description: 这是用VB 开发的一个汉诺塔程序-This is a development of the VB HANOR procedures
Platform: |
Size: 7168 |
Author: 李博 |
Hits:
Description: 用C编的hanno塔-C series Hanno tower
Platform: |
Size: 1024 |
Author: 独孤笑 |
Hits:
Description: 这是一个汉诺塔游戏的原代码,tc环境.可是图型界面的哦~~,不要认为是一般的递归了!-HANOR the original game code, tc environment. However, the map-based interface ~ ~ Oh, do not believe that the general recursion!
Platform: |
Size: 5120 |
Author: 张秋水 |
Hits:
Description: 自制汉诺塔自动演示,不足之处敬请各位指教-HANOR automatic homemade demo shortfall Department locations to enlighten
Platform: |
Size: 11264 |
Author: pdafan |
Hits:
Description: 这是一个关于汉诺塔的程序，介绍了关于汉诺塔的操作-This is a Tower of Hanoi on the procedures, information on the operation of Hanoi Tower
Platform: |
Size: 2048 |
Author: igeit |
Hits:
Description: /汉诺塔递归算法过程解析:
//汉诺塔（又称河内塔）问题是印度的一个古老的传说。开天辟地的神勃拉玛在一个庙里留下了三根金刚石
//的棒，第一根上面套着64个圆的金片，最大的一个在底下，其余一个比一个小，依次叠上去，庙里的众僧
//不倦地把它们一个个地从这根棒搬到另一根棒上，规定可利用中间的一根棒作为帮助，但每次只能搬一个，
//而且大的不能放在小的上面。解答结果请自己运行计算，程序见尾部。面对庞大的数字(移动圆片的次数)
//18446744073709551615，看来，众僧们耗尽毕生精力也不可能完成金片的移动。
//后来，这个传说就演变为汉诺塔游戏:-err
Platform: |
Size: 2048 |
Author: change |
Hits:
Description: 这是用prolog编写的汉诺塔小程序，包括了源程序以及相关的实验说明文档。可直接在prolog中运行。-It is written in prolog Tower of Hanoi applet, including source code and related documentation of experiments. Can be run directly in the prolog.
Platform: |
Size: 7168 |
Author: 唐婉 |
Hits:
Description: 简单的汉诺塔程序 用于的动态显示 排列过程-Simple Tower of Hanoi program arranged for the dynamic display during
Platform: |
Size: 51200 |
Author: 庞超慧 |
Hits:
Description: 汉诺问题：古代有一个梵塔，塔内有三个座A,B,C，要将A座大小不等的64个盘子借助B座移动到C座上，并且保持大盘子在下，小盘子在上。运用递归的方法解决~-Hanno problem: there is a Vatican ancient tower, the tower has three Block A, B, C, to A Block, plate sizes 64 to move to C through B, seat, and keep the next platter of small dishes in on. The use of recursive methods to solve ~
Platform: |
Size: 337920 |
Author: 杨科城 |
Hits:
Description: JAVA语言，使用递归的思想，解决经典的汉诺塔的问题。-hanno
Platform: |
Size: 640000 |
Author: shitou |
Hits:
Description: 汉诺塔 汉诺塔的程序编码 求次数和运算步骤-hanno
Platform: |
Size: 1024 |
Author: 王建平 |
Hits:
Description: 汉诺塔的实现，很详细，可以作为学习参考示例程序。-Tower of Hanoi' s implementation, in great detail, can serve as a learning reference sample program.
Platform: |
Size: 1024 |
Author: marine |
Hits:
Description: 算法设计课程中介绍到的汉诺塔的实现代码，汉诺塔是很经典的案例。-Algorithm design course introduction to the north tower of the han the realization of the code, han s tower is a classic case.
Platform: |
Size: 40960 |
Author: 王小菲 |
Hits:
Description: 输入汉诺塔层数，输出移动路径，例如，A到B就会显示a→b，数量不要过多否则容易死机。简单的小程序，仅供参考-hanno，input number
Platform: |
Size: 8192 |
Author: 宋健 |
Hits:
Description: Hanno塔非递归实现，用c写的非递归实现Hanno塔问题。-The Hanno tower of non-recursive
Platform: |
Size: 1024 |
Author: like |
Hits: