搜索资源列表
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
MC
- 野人与传教士问题 野人与修道士问题 m个野人n个传教士船载重为k-missionary and cannibal Churchman and savage
121212
- 一、 有三个修道什和三个野人准备用船渡河（他们都在河的一边），目前他们有一条船。条件：修道士与野人均会划船，但船一次最多只能装运两个人；任何岸边野人数不能超过修道士人数，否则修道士会被野人吃掉。-！-Savage river belongs to the problem of artificial intelligence disciplines a classic problem, it is described as follows : There are three priests (a
yerenguohe
- 人工智能中经典算法野人过河的问题C语言实现-Classic algorithms in Artificial Intelligence Savage C language implementation issues across the river
churchMan
- 野人与传教士问题（3名野人，3名传教士）-Savage and missionary issues (3 Savage, three missionaries)
MonksandSavageproblem
- 修道士与野人问题 struct INFO { int nSavage // 岸边野人的数量 开始为3 全部到对岸为0 int nBoanerges // 岸边传教士的数量 开始为3 全部到对岸为0 int nSide // 船的位置 在此岸为-1 彼岸为1 int nMoveSavage // 渡河的野人的数量，用于递归时记录操作状态 int nMoveBoanerges // 渡河的传教士的数量，用于递归时记录操作状态 INFO* p
MCO
- 人工智能实验，野人与传教士问题的源码，vc++编译。-Artificial intelligence experiments, Savage and missionaries problem code, vc++ compiler.
frame
- 用回溯法解决不是很麻烦的传教士和野人问题-By backtracking to solve is not very troublesome issue of missionaries and Savage
CrossingRiver
- 野人过河问题的实现，并有动画效果演示，用openGL做的-Savage realization of the problem across the river and have animation demo, to do with openGL
yeren_chuan
- VC++ 实现野人与传教士的锅和程序。程序是先简单易掌握。-VC++ to achieve Savage and missionaries pot and procedures. Program is the first simple and easy to master.
ai1
- 带回溯的深度优先策略：解决经典野人传教士过河问题的求解：三个修道士和三个野人过河，船一次最多只能载两个人，在任何时候修道士的人数不能少于野人人数，否则野人会吃掉修道士。找出六个人顺利过河的所有方案。 采用带回溯的深度优先搜索策略，共定义了7种合法操作{2,0,0},{1,0,0},{1,1,0},{0,1,0},{0,2,0},{0,1,1},{1,0,1}代表上船的人数，根据船所在位置决定在状态上是加或者减操作。扩展结点时按顺序应用操作，知道回溯到初始状态且所有操作用完，程序结束。-Wi
churchman
- 使用A*算法的传教士与野人的VC程序。。期望大家指正-himself wrote a missionary with the Savage issue procedures. Program structure more clearly. Complete installation of artificial intelligence inside the structure.
yerenguohe
- 有三个牧师和三个野人过河，只有一条能装下两个人的船，在河的任何一方或者船上，如果野人的人数大于牧师的人数，那么牧师就会有危险. 找出一种安全的渡河方法-There are three priests and three Savage river, and only one person can hold the next two boats in the river, or any party on board, if the savage is greater than the number
MCproblem
- 人工智能解决野人传教士本实验研究了用人工智能的理论求解传教士(Missionaries)与野人(Cannibals)过河问题（M-C问题）。实验设计采用产生式系统的概念，将问题用状态空间表示，搜索技术采用状态空间启发式搜索的A*算法，规则设计采用产生式规则，用C语言实现了A*算法求解M-C问题，加深了对人工智能的认识与理解。过河问题。-Of artificial intelligence to solve Savage missionaries studied in this experimen
upload1
- 传教士与野人问题。完美版。getStrategy函数参数是N和k，返回的是一个字符串数组，代表一个状态序列，数组中的每一个元素代表一个状态，每一个状态表示为（a，b，c），其中a表示左岸的传教士数目，b表示左岸的野人数目，c表示船是否在左岸，c=1为船在左岸，c=0为船在右岸。如果问题无解，返回只有一个元素 “no solution”的数组。-Missionaries and savages the problem. Perfect version. getStrategy function p
MC
- 用java语言实现的人工智能中野人传教士问题的解决办法-Using java language implementation of artificial intelligence in the Savage missionaries solution to the problem
MC
- Java实现，用回溯的方法解决n，k下的传教士野人问题。最后输出一个字符串数组，表示渡河过程-Java implementation, with the back of a solution n, k missionaries under the savage problems. The final output of a string array that cross the river course
895
- n个野人n个传教士过河问题的代码，文件输出结果-n n-Savage problem missionary cross the river code, files output
test
- 此程序是关于求解野人和传教士的过河问题。实现自动对一个智利测试题的求解！-This program is about the savage and missionaries across the river to solve the problem. Automatic testing of a Chilean problem solving!