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

Search list

[Mathimatics-Numerical algorithmshanoi

Description: 目的是把左边的所有盘子移到右边的杆子上。一次只能移动一个盘子,你可以使用中间的杆子作为临时存放盘子的地方。小盘子必须放在大盘子之上。问题看似不难。的确,如果盘子只有两三个,是很容易解决的。但是随着盘子数目的增加,问题就变得非常难解了。 -purpose is to the left of all the dishes moved to the right side of the pole. Only a mobile one tray, you can use the middle of the pole plate as a temporary storage place. Small plates must be placed on the platter on top. It may seem it is not difficult. Indeed, if the plate is only 23, it's very easy to solve. But with the increase in the number of dishes, the problem has become a very difficult.
Platform: | Size: 625 | 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:

[Other Riddle gameshanoi

Description: 汉诺塔游戏 C++写的 很不错的 大家下载-Tower of Hanoi game C++ Written in a very good U.S. Download
Platform: | Size: 7649280 | Author: yang | Hits:

[JSP/JavaHANNOI

Description: 汉诺塔的实现,希望可以对需要的人产生帮助-Tower of Hanoi s realization of the hope of the people in need of help
Platform: | Size: 191488 | Author: 金鱼 | Hits:

[Other GamesHanio

Description: 汉诺塔的自动演算过程,有源码,转载(用MFC制作而成)-Tower of Hanoi s automatic calculation process source, reproduced (with MFC produced)
Platform: | Size: 151552 | Author: | Hits:

[Successful incentiveAI

Description: 1912年出生于伦敦,1954年去世 1936年发表论文“论可计算数及其在判定问题中的应用”,提出图灵机理论 1950年发表论文“计算与智能”,阐述了计算机可以具有智能的想法,提出图灵测试。 1966年为纪念图灵的杰出贡献,ACM设立图灵奖 -Born in London in 1912, died in 1954 papers in 1936, On Computable Numbers and Its Application to determine the problem , proposed by Turing machine theory papers published in 1950, Calculation and smart on a computer can have smart ideas , the Turing test. Turing in 1966 to commemorate the outstanding contribution, ACM Turing Award established
Platform: | Size: 2219008 | Author: chen | Hits:

[Data structsgames

Description: 数据结构算法中一些经典的小游戏的算法,如魔法矩阵,八皇后问题,骑士游历问题,环游世界问题,一笔画问题,非递归的汉诺塔问题等-Data structure algorithm some classic game of algorithms, such as magic matrix, 8 Queen s problem, the issue of Cavalier traveled, round-the-world problem, the issue of a stroke, non-recursive problems, such as Tower of Hanoi
Platform: | Size: 8192 | Author: 王家玮 | Hits:

[Other2003202

Description: 关于HANOI塔问题,八皇后问题,复数相关运算,多态与虚函数圆柱相关运算,自动售货机,在册人员管理等等代码-HANOI tower on the issue, the eight Queen s problems related to computing complex, multi-modal virtual function cylinder associated with computing, vending machines, personnel management and so on in the code book
Platform: | Size: 541696 | Author: 唐进 | Hits:

[Algorithmvczx_hnt

Description: 汉诺塔演程序的原代码,可能对兄弟们有用,或者是兴趣爱好!我希望大家可以帮助我这个菜鸟-Tower of Hanoi s original speech program code, may be useful brothers or hobbies! I hope everyone can help me this rookie
Platform: | Size: 1660928 | Author: 姜金刚 | Hits:

[OtherHanoi

Description: 这是用递归算法实现的汉诺塔程序。实现虽然简单,但它最大的特色就是输出形式比较美观。-This is a recursive algorithm using the Tower of Hanoi program. Although simple to achieve, but it s biggest feature is the output form of comparative aesthetics.
Platform: | Size: 169984 | Author: Katherine | Hits:

[AlgorithmTowerofHanoi

Description: 输入汉诺塔的总阶数,就可以显示汉诺塔的移动步骤,即每一步的移动,最后显示移动的总次数-Enter the Tower of Hanoi s total order, we can show the movement of Hanoi Tower, that is, to every step of the movement, and finally show the total number of mobile
Platform: | Size: 1024 | Author: 白秋杨 | Hits:

[Data structshanoi

Description: 看了数据结构那本书的源代码,又学了点MFC的知识,顺便就把可视化程序做出来了,不过功能少了点,请大家多多指教!-Read the data structure of the book' s source code, but also learn a little knowledge of MFC, the way they do out of visual programming, but the functional少了点, exhibitions please!
Platform: | Size: 1693696 | Author: 萧锋 | Hits:

[Data structsHanoi-Stack

Description: Hanoi Stack source code, that s one of data structure problems
Platform: | Size: 1024 | Author: Gabriel | Hits:

[OtherHanoiTower

Description: 汉诺塔的画图程序及其汉诺塔的非递归程序。。。。感觉不错,-Tower of Hanoi Tower of Hanoi s Paint program and its non-recursive program. . . . Feel good. . . .
Platform: | Size: 1024 | Author: 董凯 | Hits:

[VC/MFCHanoi

Description: 汉诺塔演示。根据汉诺塔的叠放特点,编程自动演示塔层的移动过程-Tower of Hanoi demo. According to Tower of Hanoi' s stacking feature, programming automatically shows the process of moving the tower level
Platform: | Size: 1042432 | Author: 钟豪 | Hits:

[Data structsHANOI

Description: 汉诺塔算法,实现汉诺塔的内部模拟演示,不输出至终端,要显示自行修改代码-Tower of Hanoi algorithm, the Tower of Hanoi' s internal simulation demonstration, not output to the terminal, modify the code to be displayed
Platform: | Size: 1024 | Author: 赵阳 | Hits:

[Data structsHanoi

Description: 汉诺塔的解决,里面附带源代码,打开就能运行了!-Han s the solution of the tower, with open source code, it can run!!!!!
Platform: | Size: 227328 | Author: miste chen | Hits:

[Data structsTower-of-Hanoi

Description: 数据结构中,运用链表实现经典汉诺塔的移动。程序运行在控制台上。-Data structure, use the list to achieve the classic Tower of Hanoi s move. Program running on the console.
Platform: | Size: 184320 | Author: 一三口乂刀 | Hits:

[Data structsHanoi

Description: C/C++递归程序初探, 同样的道理,其中包括一个金典的汉诺塔和其他的 不同的方法 , -C/C + + recursive process research, in the same way, including a han s golden tower and other different methods, ha ha!!!!!!!!!!!!
Platform: | Size: 1223680 | Author: Cql_liliang | Hits:

[Otherhanoi

Description: 牛左程的书,hanoi塔特殊形式的解法,欢迎下载,谢谢使用(niu's book, special hanoi problem's solution)
Platform: | Size: 83968 | Author: 波波鸿 | Hits:
« 12 3 »

CodeBus www.codebus.net