Location:
Search - hanoi
Search list
Description: 使用回溯法解决的典型问题的算法：骑士巡游问题，n皇后问题，0-1背包问题。
使用递归与分治策略解决的几个问题的算法：Hanoi塔问题和二分搜索技术。-Use backtracking to solve the typical problems of algorithms: knight tour problem, n queens problem 0-1 knapsack problem. Use recursion and divide and conquer strategy to solve several problems of arithmetic: Hanoi tower problem and binary search technique.
Platform: |
Size: 4096 |
Author: |
Hits:
Description: c语言 实现汉诺塔，好好看看 可以感觉到它的强大 c语言 实现汉诺塔，好好看看 可以感觉到它的强大-c language HANOR, take a look you can feel it' s powerful c language HANOR, take a look you can feel it' s powerful c language HANOR, take a look you can feel its power
Platform: |
Size: 34816 |
Author: 阿莱克 |
Hits:
Description: 计算汉诺塔的最简单步骤和次数，代码很简练-The easiest calculation HANOR number of steps and the code is very concise
Platform: |
Size: 4096 |
Author: zj |
Hits:
Description: 实现汉诺塔基本功能与搬运动画，让玩家自己玩游戏的过程-HANOR basic functions and handling animation, allowing the player to play their own game in the process
Platform: |
Size: 72704 |
Author: 坂田秋雨 |
Hits:
Description: 该文件里面包括 练练看，黑白棋 ，汉诺塔推箱子等经典小游戏的源代码，开发环境为vs2010.语言为C#。-The document which includes practice your look, Reversi, Tower of Hanoi and other classic Sokoban game' s source code, development environment for vs2010. Language is C#.
Platform: |
Size: 4846592 |
Author: 崔睿龙 |
Hits:
Description: 混合惩罚函数法用于混沌理论，说明了外罚函数法河内罚函数法的原因。-Mixed penalty function method is used to chaos theory, outside the penalty function method described in Hanoi penalty function causes.
Platform: |
Size: 197632 |
Author: liqi |
Hits:
Description: 汉诺塔游戏java源代码，自动演示，改变盘子大小，选择盘子数量，改变颜色，选择等级。-Tower of Hanoi game java source code, automatic demonstration, changing plate size, select the number of plates, change the color, select rating.
Platform: |
Size: 9216 |
Author: 张德华 |
Hits:
Description: 汉诺塔递归算法 初学者学习递归很不错的源码-Tower of Hanoi recursive algorithm for beginners to learn recursion is a good source
Platform: |
Size: 221184 |
Author: John |
Hits:
Description: C语言经典算法之河内之塔,利用的开发环境是Visual C-C language classic algorithms Tower of Hanoi
Platform: |
Size: 12288 |
Author: 武洋洋 |
Hits:
Description: 四柱汉诺塔（图形界面）目前图像太小不能运行太多的盘子-Peg Hanoi Tower (graphical user interface) can not run too much current image is too small dish
Platform: |
Size: 3072 |
Author: 朱志聪 |
Hits:
Description: 汉诺塔和快排的C代码，这是一个小代码，帮助学习C语言的初学者理解-Tower of Hanoi and fast row C code, which is a little code to help beginners learn C language Li Xie
Platform: |
Size: 1024 |
Author: 章文风 |
Hits:
Description: Fibonacci Recursive Function in C by Namira
and other data structure like hybrid tree, hybrid list, binary search, hanoi recursive function and more
Platform: |
Size: 6144 |
Author: Nima |
Hits:
Description: 汉诺塔问题的递归处理，程序简洁，可改动性强。-Tower of Hanoi recursive processing.
Platform: |
Size: 1024 |
Author: 柯真东 |
Hits:
Description: 本程序为.c文件，需通过win-tc软件，运行生成exe，可观察到源于印度一个古老传说的益智玩具--汉诺塔（又称河内塔）的动态运行。
-This program is the. C file is accessed through the win-tc software, run the generated exe, can be observed from an ancient Indian legend of educational toys- Hanoi (also known as the Tower of Hanoi) dynamic operation.
Platform: |
Size: 1024 |
Author: 离歌亮仔仔 |
Hits:
Description: 汉诺塔是程序员入门的必学程序。本例用vb编写这一益智游戏。共大家参考-Tower of Hanoi is a programmer entry will learn procedures. This example vb prepared this puzzle game. A total of reference
Platform: |
Size: 32768 |
Author: fanlb |
Hits:
Description: 本代码实现了汉诺塔功能，可以根据用户需要添加柱子上盘子的数目-This code implements the Tower of Hanoi function, according to the user needs to add the number of columns on the plate
Platform: |
Size: 47104 |
Author: liqingmei |
Hits:
Description: C#（winforms）实例程序100个（俄罗斯方块游戏），内涵多个游戏程序 如俄罗斯方块 汉诺塔。。。还有初学者很有用的范例 示例-C# (winforms) Example program 100 (Tetris game), meaning more games like Tetris Tower of Hanoi. . . There are examples of useful examples for beginners. .
Platform: |
Size: 3963904 |
Author: dy |
Hits:
Description: tower of hanio program in data structure
Platform: |
Size: 8192 |
Author: hare |
Hits:
Description: 汉诺塔是根据一个传说形成的一个问题：
有三根杆子A，B，C。A杆上有N个(N>1)穿孔圆盘，盘的尺寸由下到上依次变小。要求按下列规则将所有圆盘移至C杆：
每次只能移动一个圆盘；
大盘不能叠在小盘上面。-Tower of Hanoi is formed according to a legend a problem: There are three poles A, B, C. A rod with N (N> 1) perforated disc, the disc size in order from the bottom to smaller. Requirements according to the following rules will move all disks C Rod: You can only move one disc market can not be stacked in small cap top.
Platform: |
Size: 1024 |
Author: 姚大波 |
Hits:
Description: acm程序设计,用于解决汉诺塔问题，调用递归，函数等解决-acm programming for solving Tower of Hanoi problem, call the recursive functions, etc. to solve
Platform: |
Size: 7332864 |
Author: hao |
Hits:
«
1
2
...
45
46
47
48
49
50»