搜索资源列表
knight
- 基于Java，使用GUI界面完成的国际象棋骑士遍历棋盘的问题。深度优先和广度优先皆有使用！-Completed using the GUI interface based on Java, chess knight traverse chessboard. The depth-first and breadth-first are both used!
1016TJ
- 千年太极TGS服务端,深度开发,经由源代码二次开发直接编译而成,内部集合TGS外挂工具-TGS service end of the Millennium Taiji depth development, compiled directly via the secondary development of the source code, the internal collection of the TGS plug tool
src
- 基于java实现的迷宫生成小程序，采用深度优先算法实现-Achieve maze based java applet is generated using a depth-first algorithm
src
- 《深入体验C语言项目开发》赠送案例代码，包含贪吃蛇、五子棋游戏、潜艇大战游戏三个游戏。-Depth experience of C language project development " presented case code contains Snake, backgammon games, game three of the World War II submarine game.
pathsearch
- 推箱子的搜索算法 采用深度优先的A*算法 算法具有拓展性-The Sokoban of depth-first search algorithm using A* algorithm algorithm scalability
code
- maze迷宫游戏，vc编译，本游戏源码迷宫游戏，学习如何深度优先遍历，迷宫游戏源码仅供参考-maze maze game, vc compiler source code for this game maze game, learn how depth-first traversal, maze game source code for reference only.
jyyEight_Num_Fengart
- 八数码问题的解决,包括三种路径的查找最优解，例如：深度优先查找，广度优先查找。-Eight digital problem solving, including three kinds of paths to find an optimal solution, for example: depth-first search, breadth-first search.
aboutPoint
- 对C语言的指针进行深入的讨论，对指针有独到的见解Pointer on the C-depth discussion, the pointer has a unique perspective on-Pointer on the C-depth discussion, the pointer has a unique perspective on
C-language-indepth-dissection
- C语言深度解剖，资深程序员的经验总结，是你C语言进阶的首选书籍C-depth anatomy lessons learned from a senior programmer, your first choice for advanced C language books-C-depth anatomy lessons learned from a senior programmer, your first choice for advanced C language books
VCPPshenrujiangjie
- vc++深入讲解,系统深刻的讲解vc++的开发应用vc++ in-depth explanation, to explain the profound system development and application of vc-vc++ in-depth explanation, to explain the profound system development and application of vc++
wenjiandaxiao
- 让你更好理解C++的基本内容与间接提高,并且深入领会Make you a better understanding of C++, and indirectly enhance the basic content and in-depth understanding of-Make you a better understanding of C++, and indirectly enhance the basic content and in-depth understanding of
xueshenchenji
- 让你更好理解C++的基本内容与间接提高,并且深入领会Make you a better understanding of C++, and indirectly enhance the basic content and in-depth understanding of-Make you a better understanding of C++, and indirectly enhance the basic content and in-depth understanding of
BW_Chess
- 为了熟悉C#练习写的一个黑白棋，界面比较好，除此之外一无是处，如果觉得比较简单就重新设置搜索深度-To become familiar with C# to write a practice Othello, the interface is better, in addition to nothing, if they feel relatively simple to re-set the search depth
wuziqi
- 一个用vc++6.0写得五子棋小游戏，是人与人下棋的程序。没有深入的写，但可以作为学习mfc入门的同学参考学习。-One with vc++6.0 written 331 small game, is the interaction chess program. No in-depth writing, but can be used as learning mfc entry students to learn.
liuziqi
- 支持人机对弈和人人对弈，可调节搜索深度。展示搜索过程。用eclipse直接能打开的源程序-Support the man-machine game and everyone s game, the search depth can be adjusted. Show the search process. Can directly with the eclipse open source program
Russian_Rect
- 俄罗斯方块，重温经典。本程序为你展现她的每一寸肌肤，并在她的指导下深入C-Tetris, relive classic. This program is to show you every inch of her skin, and under the guidance of her depth C++
saikeu
- 这是一款扫雷游戏，和系统自带的扫雷游戏类似，里面有详细的注释，有助于大家深入J2SE-This is similar to a minesweeper game, and the system comes with a minesweeper game, there are detailed notes, to help our in-depth J2SE
Maze-Generration-and-routing
- 设计算法生成一个N×M(N行M列)的迷宫，完成迷宫的组织和存储。实现两种不同的迷宫路由算法：广度优先和深度优先算法，并比较(包括理论和实验)两种方法的时间复杂性。-Design algorithm to generate a NM (N rows and M columns) of the maze, the maze to complete the organization and storage. Achieve two different maze routing algorithms:
mazouqipan
- 中国象棋中马走遍棋盘问题的深度搜索算法求解-Chinese Chess horses all over the board the depth search algorithm for solving
fsbl
- 通过深度优先搜索完成对粉碎玻璃游戏（可以在WP8、安卓等平台找到这款游戏）进行自动求解，只要输入相应数据就会打印出求解的步骤-Depth-first search through the completion of crushed glass game (in WP8, Android and other platforms to find the game) automatically solved, simply enter the appropriate data will print o