搜索资源列表
hanno
- 这是一个汉诺塔游戏的原代码,tc环境.可是图型界面的哦~~,不要认为是一般的递归了!-HANOR the original game code, tc environment. However, the map-based interface ~ ~ Oh, do not believe that the general recursion!
24点游戏，利用递归法
- 24点游戏，利用递归法，在vc DOS环境下运行结果，可实现多张牌多点数功能-24-point game, the use of recursion in vc DOS environment, the results can be multi-functional cards and more points
saolei
- c语言程序编写扫雷小游戏，主要用递归调用，结构体，局部清屏-C programming demining small game, mainly using recursion, structures, local screen clearing
BaHuangHou
- 题目：八皇后问题。 八皇后问题是指求解如何在国际象棋8*8棋盘上无冲突的放置八个皇后棋子。因为在国际象棋里，皇后的移动方式是横竖交叉，所以在任意一个皇后所在的位置的水平，竖直和斜45度都不能有其他棋子的存在。一个完整的无冲突的八皇后棋子分布成为八皇后问题的一个解。设计思路：我使用了回溯的方法来解决八皇后问题，也就是逐次试探的方法。这个方法是通过函数putchess()对自身的递归调用来实现的。运行程序后，主函数调用putchess()函数在棋盘第一行第一列上放置棋子，开始向下一行递归。每一步
hano
- 这是一个不利用递归实现汗诺塔的例子，让我们看看原来简单的 hanoi (n-1,a,c) hanoi (n,a,b) hanoi (n-1,c,b) 由于无法使用递归，需要什么样的手段才能实现。-This is a non-recursive implementation Khan, Tower of Hanoi example, let' s take a look at the original simple hanoi (n-1, a, c) hanoi
Hanio
- 汉诺塔游戏的设计 汉诺塔问题是最经典的递归问题-Tower of Hanoi Tower of Hanoi game design is the most classic recursion problem
EightQueensProblem
- 在8*8的国际象棋盘上放置八个皇后，使其不能互相攻击，用递归法求出所有布局-8* 8 placed on the international chess board eight queens, so that it can not attack each other, all the layout obtained by recursion
chinachess
- 自己编写的中国象棋。c语言编写。通过枚举法，遍历一定深度中的所有情况，递归深度可以在代码中修改。没有棋盘的库，每步均为即时计算所得。-I have written in Chinese chess. c language. By enumeration, traversing a certain depth in all cases, recursion depth can be modified in the code. No library board, each step are calc
WuZiQi
- 本人原创的五子棋游戏，算法很独特，没有采用递归就达到了不错的结果。-My original backgammon game, the algorithm is unique, does not use recursion to achieve good results.
saolei
- 以Visual C++ 6.0为开发环境，设计并开发一款扫雷游戏，其功能类似于Windows操作系统自带的扫雷游戏。论文首先介绍了制作游戏的整体思路及整个游戏设计的流程规划，然后介绍了雷区的布置以及地雷随机产生的实现方法；重点介绍了在游戏过程中各事件的处理，其中又以鼠标事件和清除未靠近地雷区方块这两方面最为最要，鼠标事件是利用鼠标所发出的信息了解使用者的意图，进而做出相对应的动作，而清除未靠近地雷区方块由于引进了“递归”这个概念而使其简单化。-What my thesis research fo
Fujida
- 使用负极大算法实现黑白棋的对弈，中间使用递归，底层用MFC搭建。-Using negative great algorithm black white s play chess, and the middle use recursion, bottom with MFC structures.
ItcastTetris
- 在ecplise上开发的完整工程源码代码，有完整的功能，优秀的递归算法，实现很好的逼真的俄罗斯方块游戏图片和标准-In ecplise developed on complete source code engineering, complete functionality, excellent recursion algorithm, achieve good lifelike Russian square game pictures and standards
Squared-Up
- 运用递归算法解决九宫格问题，分析详细，代码简单易懂-Using recursion algorithm to solve JiuGongGe problem, analyze the detailed, code simple and understandable
PA7a
- ReverseRecurse.java: Write an application that reads integer values from the keyboard into an array whose size is specified by the user (the user may enter fewer integers than the size Start Early!!! specified, but not more) and reverse t
TowersofHanoi
- classic game of recursion, tower of hanoi
MineSweep
- 是一个用VC6.0编制的扫雷游戏，该游戏用主要用C语言中的数组、递归来做的，实现了初级的扫雷游戏。-VC6.0 compiled a minesweeper game with, the game is mainly written in C language with arrays, recursion to do to achieve the primary game of mine.
EightQueensProblem
- 在8*8的国际象棋盘上放置八个皇后，使其不能互相攻击，用递归法求出所有布局-8* 8 placed on the international chess board eight queens, so that it can not attack each other, all the layout obtained by recursion
EightQueensProblem
- 在8*8的国际象棋盘上放置八个皇后，使其不能互相攻击，用递归法求出所有布局-8* 8 placed on the international chess board eight queens, so that it can not attack each other, all the layout obtained by recursion
hanno
- 这是一个汉诺塔游戏的原代码,tc环境.可是图型界面的哦~~,不要认为是一般的递归了!-HANOR the original game code, tc environment. However, the map-based interface ~ ~ Oh, do not believe that the general recursion!
Drunkard
- n this program you will get a chance to use recursion to solve a problem that could not be done just as easily or more efficiently with a loop. It is possible to solve this problem without recursion, but it would somewhat more complicated, and would