搜索资源列表
传教士和野人过河
- 在VC的环境下，用C++编程实现人工智能中的A*树的搜索算法，得到一个最优的过河方案。-in VC environment, the C programming AI * A tree search algorithms, to be an optimal program of the river.
过河算法
- 过河算法属于面试经典算法，有很多人会被问到，羊虎人咋个过河才安全-algorithm belongs to the river interviews classic algorithm, a lot of people asked that the sheep were 17th Tiger river safe
123.
- 人工智能元陈旭下载（传教士与野人的过河问题，基于A*算法的）
农夫过河
- 一个农夫过河问题的算法-a farmer crossing the algorithm
flash过河算法
- 警察小偷爸爸妈妈儿子女儿过河，这个游戏不用说的吧，应该很多人见过，一般是考察隔壁邻居家小朋友智商的，有人把他做成了FLASH游戏。规则如游戏图。详细请看文件中那个FLASH游戏-police thieves Mom and Dad son daughter to cross the river, the game goes without saying that it should be seen many people, the general is to investigate the ch
野人过河问题算法分析
- 一个经典人工智能算法,希望大家共同学习.-a classic artificial intelligence algorithm, we hope to learn together.
SY0915129
- 野人过河问题，本实验研究了用人工智能的理论求解传教士(Missionaries)与野人(Cannibals)过河问题（M-C问题）。实验设计采用产生式系统的概念，将问题用状态空间表示，搜索技术采用状态空间启发式搜索的A算法，规则设计采用产生式规则，用C语言实现了A算法求解M-C问题，加深了对人工智能的认识与理解。-Savage river problems, this experimental study the theory of using artificial intelligence t
6
- 人携带狐狸，鹅，豆子安全过河问题，应用各种不同算法，SWI-prolog编程，简单游戏-Person carrying a fox, geese, beans safety problem across the river, the application of different algorithms, SWI-prolog programming, easy Games
river
- 三个强盗和三个商人过河的算法，简单的入门级别算法。适合刚接触算法初级编程人员。-Three bandits and three businessmen across the river of the algorithm, a simple entry-level algorithm.刚接触algorithm suitable for junior programmers.
artificial_intelligence_demo_programs
- 光盘中的演示实例是人工智能原理和方法的演示程序.包括基于归结原理的推理系统,合一算法,等式归结,归类算法,野人与传教士过河问题,八数码问题,八皇后问题,一字棋,博弈算法,遗传算法和蚁群算法等的演示。-CD-ROM presentation of a number of examples of the hard work of graduate and undergraduate results. Including reasoning based on the principle of the
23
- 传教士与野人过河问题是经典的人工智能问题，本程序采用深度优先算法解决此问题。-Savage missionaries across the river and the artificial intelligence problem is a classic problem, the procedures for the use of depth-first algorithm to solve this problem.
3
- 野人过河，这是一个古典问题，算法很经典，我看了好多遍，现在能闭着眼睛写出来了，-Savage river, this is a classical problem, the algorithm is very classic, I saw a lot of times, are now able to write out your eyes closed, He He
20090831
- 野人过河，这是一个古典问题，算法很经典，我看了好多遍，现在能闭着眼睛写出来了，-Savage river, this is a classical problem, the algorithm is very classic, I saw a lot of times, are now able to write out your eyes closed, He He
Farmer_River
- 农夫过河算法 问题描述： 1在有限的步数内，农夫要把狼、羊、菜都运过河 2每次只能带一样或不带，狼和羊，菜和羊无法在岸边共存 备注：在DEV下编译通过-Farmers across the river algorithm Problem Descr iption: in a limited number of steps, the farmers make the wolf, sheep, and vegetables were transported a
MCproblem
- 人工智能解决野人传教士本实验研究了用人工智能的理论求解传教士(Missionaries)与野人(Cannibals)过河问题（M-C问题）。实验设计采用产生式系统的概念，将问题用状态空间表示，搜索技术采用状态空间启发式搜索的A*算法，规则设计采用产生式规则，用C语言实现了A*算法求解M-C问题，加深了对人工智能的认识与理解。过河问题。-Of artificial intelligence to solve Savage missionaries studied in this experimen
GUOHE
- 使用A星算法求解野人过河问题，VC++实现，用D到了MFC-A star algorithm using the issue of Savage river, VC++ to achieve, with the D to the MFC
missionaryandsavage
- 用C++实现人工智能中的传教士与野人过河问题，其于A*算法实现。-C++ implementation with the missionaries and the artificial intelligence problem of Savage river, which at the A* algorithm.
missionaryandsavage
- missionary and savage基于A*算法实现传教士与野人过河问题，用C语言实现的原代码。-missionary and savage A* algorithm-based missionaries and savages across the river problem, the original language with C code.
CorssRiver
- 有N个传教士和N个野人要过河，现在有一条船只能承载K个人（包括野人），K<N，在任何时刻，如果有野人和传教士在一起，必须要求传教士的人数多于或等于野人的人数。 用A*算法实现。-N and N have a savage missionary to cross the river, there is now a boat can only hold K individuals (including Savage), K <N，在任何时刻，如果有野人和传教士在一起，必须要求传教士的
Churchman_and_goth
- 使用A*算法实现传教士和野人过河问题，包括设计状态表示，规则库，启发函数等。-Using the A* algorithm and Savage missionaries across the river, including the design state that the rule base, heuristic function, etc.