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

Search list

[OtherHANOI非递归算法(带动画演示)

Description: HANOI非递归算法(带动画演示)-HANOI non - recursive algorithm (with the animation demo)
Platform: | Size: 2717 | Author: 井中月 | Hits:

[Other resourcehanoi

Description: hanoi
Platform: | Size: 9062 | Author: backhappy | Hits:

[Other resourceHanoi

Description: 汉诺(Hanoi)塔问题的模拟器。采用C++语言开发。可以演示需要多少步解决问题,并演示解决问题的过程。
Platform: | Size: 28964 | Author: gubaogang | Hits:

[Mathimatics-Numerical algorithmshanoi

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

[Mathimatics-Numerical algorithmshnoi

Description: 一个汉诺塔示例程序-Tower of Hanoi example of a procedure
Platform: | Size: 32768 | Author: 站长 | Hits:

[SourceCode2001374424

Description: 用汇编编写的河内塔程序 将第一柱a上n-1个盘借助第二柱c移到第三柱b 把a上剩下的一个盘移到c 将n-1个盘从b借助a移到第三柱c 这三步是图示河内塔的根本方法 功能一:自己动手移动河内塔 先按左右键选择要移的盘,按箭头上键确定 再按左右键移到要的盘 如此,再根据河内塔的规则确定较好的次数step2 功能二:图示河内塔移动过程 根据河内塔的基本方法,确定图象,按任意键选下一步,(开始时输入level)- A n-1 plate transfers to with the assembly compilation Hanoi tower procedure first column a on with the aid of second column c third column b a plate which is left over a on to transfer to c to transfer to a n-1 plate from b with the aid of a third column c these three step is the graphical representation Hanoi tower basic method function one: About own begin to move the Hanoi tower first to press the plate which the key elects 鎷╄
Platform: | Size: 214016 | Author: 吴晓辉 | Hits:

[Game Programhanoi

Description: 本人自己做的汉若塔游戏! 非常有意思 !-I do for myself Han JOTA game! Very interesting!
Platform: | Size: 3072 | Author: 流星 | Hits:

[Other一个汉诺塔程序

Description: 重演经典的汉诺塔。 做课程设计时做的,不算太好,呵呵…… 不过还算基本规范吧。适合初学者。-repeat of the classic Tower of Hanoi. Courses designed to do so, not too good, huh ... but it still basic norms. For beginners.
Platform: | Size: 203776 | Author: 无风 | Hits:

[JSP/Java汉诺塔(Hanoi)

Description: 一个汉诺塔问题的模拟程序,包含图形模拟和过程同步显示(华南农业大学信息学院计算机系).-one of the simulation program, including graphics simulation and process synchronization Display (South China Agricultural University, Department of Computer Information Institute).
Platform: | Size: 10240 | Author: 吴辞仁 | Hits:

[Process-Threadhanoi_star_multiple_thread

Description: 自编的hanoi游戏,一个windows界面的程序,原理很简单,关键是多线程编程,可以供大家学习,目前这个程序还有一个小bug但是实在是不知道是什么问题,如果有那位能和我一起学习windows编程,请联系我-directed the Hanoi games, a windows interface procedures, principle is very simple, the key is multi-threaded programming, everyone can learn that the present procedures also a small bug but is not sure what the problem is, if there who I can learn and windows programming, please contact me
Platform: | Size: 48128 | Author: | Hits:

[Process-Thread2004122810505681

Description: Hanoi塔演示程序,Hanoi塔是一个不错的 游戏-Hanoi tower demo program, Hanoi Tower is a good game
Platform: | Size: 12288 | Author: zd | Hits:

[Windows Develop20041120014103

Description: 该程序是Java汉诺塔演示程序,图形界面操作良好.-This software is a demo of tower of hanoi game with graphical interfaces and operates easily.
Platform: | Size: 11264 | Author: hwl | Hits:

[ComboBox耿5

Description: oid move(char x,char y,struct H num[3]) /*Ò Æ ¯ µ Ä ¾ ß Ì å ¹ ý ³ Ì */ void hanoi(char x,char y,char z,int n,struct H num[3]) /*µ Ý ¹ é*/ void Init(void) /*³ õ Ê ¼ » ¯ */ void Close(void) /*Í ¼ Ð Î ¹ Ø ±Õ */ int computer=1 /*×Ô ¯ ¿ Ø Ö Æ Ó ë Ê Ö ¯ ¿ Ø Ö Æ µ Ä ±êÖ ¾ */ int speed=0 /*È « ¾ Ö ±ä Á ¿ speedÖ ÷Ò ª Ê Ç Ñ Ý Ê ¾ ¹ ý ³ Ì µ Ä Ë Ù È */-oid move (char x, y char, struct H num [3])/* Ograve AElig Macr micro Auml frac34 szlig Igrave aring sup1 yacute sup3 Igrave*/void Hanoi (char x, char y, z char, int n, struct H num [3])/* micro Yacute sup1*/void Init (void)/* sup3 otilde Ecirc frac14 raquo Macr*/void Close (void)/* Iacute frac14 ETH Icirc sup1 Oslash Otilde*/int computer = 1/* x Ocirc Macr Almost Oslash Ouml AElig Oacute euml Ecirc Ouml Macr Almost Oslash Ouml AElig micro Auml Ouml frac34*/int speed = 0/* Egrave laquo frac34 Ouml auml Aacute Almost speedOuml Ograve ordf Ecirc Ccedil Ntilde Yacute Ecirc frac34 sup1 yacute sup3 Igrave micro Auml Euml Ugrave Egrave* /
Platform: | Size: 25600 | Author: | Hits:

[CSharphanoihanoi1

Description: 一个典型的问题hanoi问题,这里用了一个递归函数来解决的-a typical problem Hanoi, here used a recursive function to solve the
Platform: | Size: 9216 | Author: 吴彬 | Hits:

[Windows DevelopsoftVC++_Hanoi

Description: C++编写的汉诺塔程序 有比较强的界面显示功能! 步骤详细-Hanoi in C++,more powerful in display!
Platform: | Size: 132096 | Author: 康抗 | Hits:

[GDI-BitmapMyHanio

Description: 动华演示汉诺塔的盘子的搬移过程,例子中含有10个盘子!-Demonstrate the process of moving the Hanoi Dishes . There are 10 dishes in this programe
Platform: | Size: 37888 | Author: 王博 | Hits:

[GDI-BitmaphanoiTower

Description: 汉诺塔程序,基本功能已经实现,但还需要进行修改-a hanoi Tower program with all foundment functions implementad. but still needs some further modificaton.
Platform: | Size: 188416 | Author: 杜成文 | Hits:

[Data structsData Structures with C++ Using STL

Description: 这是数据结构和算法的国外经典书籍.清华大学出版社出版的<数据结构C++语言描述-应用模板库STL>陈君 译 英文名称是Data Structures with C++ Using STL. 作者: William Ford ,William Topp . 代码代码当中包含各种经典算法 ,比如各种排序 如选择排序,基数排序,快速排序等等.还有各种其他经典算法,有 8皇后问题,汉烙塔 Hanoi ,约瑟肤等了。此原文件是我们学校的一个博士从国外带回的,花了80美元,请大家好好的利用好.-This the data structure and algorithm abroad classic books. Qinghua University Press published lt; C data structure description language-STLgt Application Template Library; Chen translation of the English name of the Data Structures Using C with STL. Author : William Ford, William countries. Source code which packets containing various classical algorithms such as various sequencing option, in order of ranking base, rapid sequencing etc.. there are various other classic algorithms, 8 Queens, tower-baked Hanoi, Joseph skin waiting. This original document was the one Dr. schools from abroad back to a cost of 80 US dollars, please make good use of good.
Platform: | Size: 3531776 | Author: 冰舟 | Hits:

[GUI Develop21codes.comdel101445354645

Description: 一个从网上找的汉诺塔的源代码,大家可以看看,比较经典,-one from the Internet to find the Tower of Hanoi's source code, we can see, more classic, huh
Platform: | Size: 254976 | Author: 包拯 | Hits:

[Otherhanoi(Titan)

Description: 汉诺塔解答程序,通过递归实现,好多书上都有这个练习题吧-HANOR answer process, through recursive, many of the books have it Exercises
Platform: | Size: 5120 | Author: | Hits:
« 1 2 3 45 6 7 8 9 10 ... 50 »

CodeBus www.codebus.net