搜索资源列表
hanoi
- 不利用递归实现汗诺塔- Does not use the recursion realization perspiration promise tower
Tower
- 用递归算法在vc中实现多层hanoi塔,程序实现动画显示-Recursive algorithm used in vc achieve multi-storey tower hanoi, procedures to achieve animation show
hannuota
- 用c++的MFC写的汉诺塔程序,可自由选择塔的层数,运行过程中实现塔的自动移动;-With c++ The MFC write Tower of Hanoi procedures, are free to choose the low-rise tower, tower to run the course of the realization of the automatic movement
Tower
- 汉诺塔的C语言实现以及冒泡排序.就这些了。刚才那个传错了。-Tower of Hanoi C-language implementation, as well as bubble sort. That' s all. That pass just wrong.
tower
- 数塔问题,求从塔顶到塔底的路径,且该路径上的节点值的和最大-tower constituted by number,the program will find a path which is the max sum from points in the path.
hannuota
- 汉诺塔代码A*算法,根据人工智能提供的算法思路,编写的程序-Tower of Hanoi code A* algorithm
hannuota
- VC++汉诺塔算法的实现,动态移动图形。-VC++ Tower of Hanoi algorithm, dynamic mobile graphics.
Tower-of-Hanoi
- 数据结构中,运用链表实现经典汉诺塔的移动。程序运行在控制台上。-Data structure, use the list to achieve the classic Tower of Hanoi s move. Program running on the console.
Hans-tower
- 相传印度教的天神梵天在创造地球这一世界时,建了一座神庙,神庙里竖有三根宝石柱子,柱子由一个铜座支撑。梵天将64个直径大小不一的金盘子,按照从大到小的顺序依次套放在第一根柱子上,形成一座金塔,即所谓的梵塔(又称汉诺塔)。天神让庙里的僧侣们将第一根柱子上的64个盘子借助第二根柱子全部移到第三根柱子上,即将整个塔迁移,同时定下3条规则: (1)每次只能移动一个盘子; (2)盘子只能在三根柱子上来回移动,不能放在他处; (3)在移动过程中,三根柱子上的盘子必须始终保持大盘在下,小盘在上。
Tower-of-Hanoi
- 汉诺塔数据结构编程的源代码,有趣的小程序-Tower of Hanoi data structure programming,it s a interesting program.
C-language-practice-hans-tower
- 简单实现汉诺塔计算,不是很复杂,此过程使用递归算法-Simple to implement han s calculation tower, not very complex, this process using recursion algorithm
DIT_FFT_WAWS-for-tower
- 针对塔架建立的谐波叠加法模拟风速,计算时间长-Long calculation time simulation of wind tower to establish harmony superposition method
Tower-of-Hanoi-problem-
- VC++6.0中“汉诺塔”问题的实例源程序-Source code of "Tower of Hanoi""problem in VC++6.0
tower-of-hanoi
- tower of hanio program in data structure
Tower-of-Hanoi
- Tower of Hanoi,Tower of Hanoi-Tower of Hanoi
bouble-tower
- 背景 从前,有一个古老的帝国有两个形状不同的塔分别在不同的两个城市里。这两个塔是用圆形的砖一块一块建成的。这些圆形砖的高度是一样的,其半径都是整数。很明显,尽管这两个塔形状不同,但造塔所使用的圆形砖却有很多是相同的。 过了很多年,一个国王命令他的建筑师们移除两个塔的部分砖以便使它们的形状完全一样,同时使两个塔的高度尽可能的高,并且新塔的砖瓦的排列顺序必须与原来的一样。国王认为这样的两个塔象征着这两个城市之间的和谐和平等,于是命名它们为双胞胎塔。 任务 现在,两千年以
Tower-of-Hanoi-problem
- 算法设计与分析之汉诺塔问题介绍与讲解 希望大家有时间看看 -Tower of Hanoi problem descr iption and explanation of the design and analysis of algorithms hope that we have time to look at
tower-issue
- 数据结构 动态规划算法 数塔问题的C语言代码-C language code number of dynamic programming algorithm data structure tower issue
Tower-of-Hanoi
- 该文件包括了非递归、换位递归、汉诺塔、汉诺塔2、汉诺塔画图版、四塔、四塔2这7个c源文件-The document includes a non-recursive, transposition recursion, Tower of Hanoi, Hanoi Tower 2, Tower of Hanoi drawing version, four towers, four towers 2 7 c source files
tower-of-Han
- 此为汉诺塔程序,汉诺塔层数为输入变量,其它不需要输入-This is the Tower of Hanoi program, Hanoi layers as input variables