搜索资源列表
8_nums
- 一个九宫问题的源码，a星算法，深度优先广度优先算法都有-a JiuGongTu the source, a Star algorithm, depth-first algorithm has breadth priority
Battlefield_C_2008
- This application is a battlefield simulator game with three types of units: Infantry, Cavalry, and Artillery. The map consists of several different terrain types lined in a six-sided-square grid as seen in many turn-based video games. The computer pl
ChnChess
- 本程序在Windows98下用VC6.0编译通过，所使用位图来源于“象棋大师”教学软件， 设计和改进时参考了BorlandC++3.1的国际象棋程序和陈成涛所写的“中国象棋程序”。 在算法上采用有界深度优先Alpha-Beta剪枝递归搜索技术-The program under Windows98 using VC6.0 to compile, the use of bitmap from " Chess Master" teaching software design and
huarongdao
- “华容道”游戏解法的研究与实现 “华容道”是中国古代传统单人玩的拼板类游戏。虽然以前多次见到报刊、网络有具体解法的报道,但未见到有对此游戏全面的分析和通用局的计算机解法的描述。为此,作者采用改进的非递归深度优先算法对《华容道》通用局的解法进行了全面的分析和论证。随后通过编程实现了这一通用解法,并通过对当前常见的几十个布局进行了测试,从而验证了分析结论及其有效性。-" Huarong" Research and implementation of the game solut
skode
- 自己用c++编写的计算数独的程序。使用枚举法，深度优先搜索得出结果。不能判断是否有多解。适合初级程序员参考。-Their written using c++ calculate the number of separate procedures. Enumeration method used, the outcome of depth-first search. Can not determine whether the multiple solutions. Junior programme
TileProblem.tar
- This is simulation of classic 15 tile puzzle problem solver. It has capability to solve the problem using artificial intelligent techniques of depth first search and A-star search. This project is completely done in netbeans for running game requ
AIprogram3
- 用c++语言实现井字棋的游戏，要求要用深度优先搜索的算法。-Written in c++ language realization, well character chess game with requires depth first search algorithm.
qishixunyou
- 国际象棋棋盘的骑士巡游问题，深度优先，穷举搜索-Chessboard knight tour problem, depth first, exhaustive search
Maze
- 自己用Java写的一个随机生成迷宫程序，采用深度优先算法生成迷宫，模拟小老鼠走迷宫。-A randomly generated maze procedure written in Java, using depth-first algorithm to generate a maze to simulate the maze of little mice.
BFS_DFS
- Breath First Search and Depth First Search
EightQueen_bcb6
- (This is Borland C++Builder version) The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard so was originally proposed in 1848 by the chess player Max Bezzel, and over the years, many mathematicians, including
EightQueen_java
- (This is Java version) The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard so was originally proposed in 1848 by the chess player Max Bezzel, and over the years, many mathematicians, including Gauss, have wo
EightQueen_vb
- (This is Visual Basic 6 version) The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard so was originally proposed in 1848 by the chess player Max Bezzel, and over the years, many mathematicians, including Gaus
EightQueen_vs2008
- (This is VS2008 version) The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard so was originally proposed in 1848 by the chess player Max Bezzel, and over the years, many mathematicians, including Gauss, have
knight
- 基于Java，使用GUI界面完成的国际象棋骑士遍历棋盘的问题。深度优先和广度优先皆有使用！-Completed using the GUI interface based on Java, chess knight traverse chessboard. The depth-first and breadth-first are both used!
src
- 基于java实现的迷宫生成小程序，采用深度优先算法实现-Achieve maze based java applet is generated using a depth-first algorithm
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.
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: