Welcome![Sign In][Sign Up]
Location:
Search - hanoi tower

Search list

[Other resourceHANOI 塔问题求解

Description: HANOI 塔问题求解.cpp,HANOI 塔问题是数据结构中具有典型的代表性问题-HANOI tower question solution cpp, the HANOI tower question is in the construction of data has the model the representative question
Platform: | Size: 817 | Author: 杨涛 | Hits:

[Multimedia programHanoi塔java源程序

Description: Hanoi塔java源程序 一个经典的递归程序,在java上的实现。-Hanoi tower java source a classic recursive procedure, in the realization of java.
Platform: | Size: 12014 | Author: 清波 | Hits:

[Mathimatics-Numerical algorithmshanoi

Description: 不利用递归实现汗诺塔- Does not use the recursion realization perspiration promise tower
Platform: | Size: 1024 | Author: 站长 | Hits:

[Data structsHANOI 塔问题求解

Description: HANOI 塔问题求解.cpp,HANOI 塔问题是数据结构中具有典型的代表性问题-HANOI tower question solution cpp, the HANOI tower question is in the construction of data has the model the representative question
Platform: | Size: 1024 | Author: 杨涛 | Hits:

[Otherhanoi

Description: 汉诺塔(又称河内塔)问题是印度的一个古老的传说。后来,这个传说就演变为汉诺塔游戏: 1.有三根杆子A,B,C。A杆上有若干碟子 2.每次移动一块碟子,小的只能叠在大的上面 3.把所有碟子从A杆全部移到C杆上 此外,汉诺塔问题也是程序设计中的经典递归问题。-Tower of Hanoi (also known as the Hanoi tower) problem is an ancient Indian legend. Later, the legend evolved into the Tower of Hanoi game: 1. Has three pole A, B, C. A pole has a number of plate 2. Every time a piece of plate movement, only a small overlap in the above 3. All the dishes all from A to C on a post shot In addition, Tower of Hanoi problem is a classic programming delivery naturalization issues.
Platform: | Size: 35840 | Author: 黄俊斌 | Hits:

[assembly languagehanoi

Description: 汇编语言实现汉诺塔移动问题,显示每次移动码盘的源轴和目标轴。是汇编程序asm语言中子过程调用方面的课题,为程序嵌套-Assembly Language realize mobile Tower of Hanoi problem, show that each mobile source encoder shaft axis and objectives. Asm assembler language is a process called neutron aspects, for the nested procedures
Platform: | Size: 128000 | Author: 侯伟 | Hits:

[OtherHanoi

Description: 汉诺塔演示及手动游戏程序,可选择3-7层之间的汉诺塔进行演示和游戏,演示和游戏过程均配有音效-Tower of Hanoi game demo and manual procedures, to choose between 3-7 layers of Hanoi Tower presentations and games, demos and games are equipped with audio process
Platform: | Size: 820224 | Author: sherry | Hits:

[Otherhanoi

Description: 算法实验,可以实现hanoi塔的实验,得到最优的解,所用时间是最短的-Experimental Algorithm can be achieved hanoi tower experiments, the optimal solution, the time is the shortest
Platform: | Size: 220160 | Author: xusong | Hits:

[Otherhanoi

Description: hanoi塔问题描述:有a,b,c三个塔座。开始时,在塔座上有一叠共n个圆盘,这些圆盘自下而上,由大到小地叠在一起。各圆盘从小到大编号为1,2,....,n。现在要求将塔座a上的这一叠圆盘移动到塔座b上,并仍按同样顺序叠置。在移动圆盘时应遵守以下移动规则: (1)每次只能移动一个圆盘 (2)任何时刻都不允许将较大的圆盘压在较小的圆盘之上 (3)在满足规则(1),(2)的前提下,可将圆盘a,b,c中任何一塔座上-tower of hanoi Description: have a, b, c three塔座. Initially, in塔座on a total of n has a pile of disks, these disks bottom-up, descending to stack together. The disc from small to large number 1,2 ,...., n. Now requested that塔座a disc on the stack to move to塔座b, and is still the same order, stacked. In the mobile disk mobile rules should comply with the following: (1) can only move one disc (2) any time does not permit a larger disc pressure in the smaller disk on top of (3) in meeting the rules (1), (2) under the premise of the disc may be a, b, c 1塔座on any
Platform: | Size: 1024 | Author: 忠波 | Hits:

[Data structsHANOI_I

Description: 著名的世界末日问题-河内之塔(Towers of Hanoi) 的递归算法很容易实现,但效率不过,但非递归算法会写的人却很少,这个非递归算法不但高效,并且简短-The end of the world well-known problem- Hanoi Tower (Towers of Hanoi) of the recursive algorithm is very easy to realize, but efficiency, however, non-recursive algorithm will be written, but rarely, the non-recursive algorithm is not only highly efficient and short
Platform: | Size: 1024 | Author: li | Hits:

[OtherHanoi

Description: 汉诺塔问题演示程序 只需输入盘子个数点击START即可演示出最少次数移动盘子的玩法-Hanoi Tower Problem demo program just enter the number plates click START to demo out at least the number of mobile plate options
Platform: | Size: 1024 | Author: daniel | Hits:

[Algorithmhanoi

Description: 递归方法的汉诺塔问题,网上大多没有界面,这个有界面,有游戏功能!-Recursive method of Hanoi Tower problem, on-line do not have any interface, this interface has gaming features!
Platform: | Size: 948224 | Author: lizhaolong | Hits:

[Game Programtower

Description: 自制 汉诺塔 游戏 mfc程序 程序非常简单 适合初学-Hanoi Tower made the game very simple procedure mfc procedures suitable for beginners
Platform: | Size: 31744 | Author: wxf | Hits:

[Otherhanoi

Description: this the program of the solving of hanoi tower game-this is the program of the solving of hanoi tower game
Platform: | Size: 32768 | Author: san_shinee | Hits:

[Software Engineeringtusousuo

Description: 状态图实际上是一类问题的抽象表示。事实上,有许多智力问题(如梵塔问题、旅行商问题、八皇后问题、农夫过河问题等)和实际问题(如路径规划、定理证明、演绎推理、机器人行动规划等)都可以归结为在某一状态图中寻找目标或路径的问题。因此,研究状态图搜索具有普遍意义。 -State diagram is actually a class of abstract representation of the problem. In fact, there are many mental problems (such as the Hanoi Tower problem, traveling salesman problem, the eight queens problem, the farmer across the river and so on) and the actual problems (such as path planning, theorem proving, deductive reasoning, robot action planning, etc.) can be attributed to in a state diagram for the target or the path to find the problem. Therefore, the study state diagram search of universal significance.
Platform: | Size: 1251328 | Author: 菲菲 | Hits:

[J2MEHanoi

Description: J2ME 汉诺塔(hanoi)小游戏 ,堆栈实现,包括源码及资源文件 风格独特,操作简单,初学J2ME 就算是个设计作业吧。-J2ME Tower of Hanoi (hanoi) games, stack implementation, including source code and resource files unique, simple, even beginners just a design job.
Platform: | Size: 394240 | Author: mario | Hits:

[Otherhanoi-tower

Description: 汉诺塔 输入汉诺塔个数 输出进行的步骤及结果哦-hanoi tower
Platform: | Size: 3072 | Author: evexu | Hits:

[OtherHanoi-tower-deluxe-

Description: c语言编写的汉诺塔动画-Hanoi tower deluxe animation written in C language
Platform: | Size: 1024 | Author: 王阳阳 | Hits:

[Other GamesHanoi-Tower

Description: 著名的汉诺塔问题编码,用C++写的,简单明了-Hanoi Tower
Platform: | Size: 1680384 | Author: 宝煜 | Hits:

[CSharpHanoi Kuleleri

Description: hanoi tower,hanoi kuleleri
Platform: | Size: 31744 | Author: hannibalctg | Hits:
« 12 3 4 5 6 7 8 9 10 ... 42 »

CodeBus www.codebus.net