搜索资源列表
传教士与野人渡河问题深度优先搜索
- 学习人工智能作的一个小设计，用VC++6.0来基本实现传教士和野人渡河问题，这个算法是应用深度优先搜索算法。-study artificial intelligence for a small design, VC 6.0 to achieve missionaries and savage river, the algorithm is the use of depth-first search algorithm.
传教士野人渡河c源码
- 传教士野人渡河c源码 广度优先搜索
传教士野人过河问题
- 设有3个传教士和3个野人来到河边，打算乘一只船从右岸渡到左岸去。该船的负载能力为两人。在任何时候，如果野人人数超过传教士人数，那么野人就会把传教士吃掉。他们怎样才能用这条船安全地把所有人都渡过河去?
src
- 商人过河问题是数学建模中的一个经典问题，程序利用链表存储渡河状态，使用穷举的算法实现。该算法会找出N个商人/随从渡河的一个可行方案，但并不保证是最佳方案。写完这个程序后让我想到的居然是图的深度优先搜索，二者在查找的思想上是类似的。-Merchants across the river mathematical modeling problem is a classic problem, the use of list storage procedures to cross the river,
lieren+lang
- 猎人要带一条狼、一只羊和一棵大白菜过河。船太小，一次只能带一样。但猎人不在场的情况下，狼要吃羊，羊要吃白菜。请设计一个C++程序为猎人指出一个安全的渡河放案。 资源中有c++源程序和文档说明-Hunters to take a wolf, a sheep and a cabbage across the river. Ship is too small, one can only bring the same. However, the presence of hunters, the wolf
yerenduhe
- 这是一遍人工智能的一个很经典的算法，是人工智能的一次实验课的课题：”传教士与野人渡河问题”。-This is again a very classic artificial intelligence algorithms, is an experimental class of artificial intelligence topics: The Missionary and the Savage River problem.
crossriver
- 三个商人各带一名随从过河 随从们密约, 在河的任一岸, 一旦随从的人数比商人多, 就杀人越货. 但是乘船渡河的方案由商人决定.商人们怎样才能安全过河?-Three businessmen with an entourage of the entourage had a secret across the river, any river bank, once the number of followers more than businessmen on banditry. But to
river
- 智者:渡河问题 一个摆渡人要把一只狼一只羊和一捆菜运过河去.由于船很小,每次摆渡人至多只能带一样东西.另外,如果人不在旁边时,狼要吃羊,羊要吃菜.问这人怎样才能将他们运过河去. -Wise:摆渡人to cross the river to the issue of a wolf a sheep and a bunch of food shipped across the river. As the boat is very small, each only with a maximum
duheyouxi
- 渡河游戏,一种益智游戏，很好玩，有助于提高编程能力，大家多多指教啊-To cross the river game, a puzzle game, very fun, help to improve programming ability, all the exhibitions ah
ren
- 某人带狼、羊以及蔬菜渡河，一小船除需人划外，每次只能载一物过河。而人不在场时，狗要吃羊，羊要吃菜，问此人应如何过河？-A person with a wolf, sheep and vegetables to cross the river, a boat need not only draw people outside, each containing an object across the river only. And the person' s absence, the dog
MonksandSavageproblem
- 修道士与野人问题 struct INFO { int nSavage // 岸边野人的数量 开始为3 全部到对岸为0 int nBoanerges // 岸边传教士的数量 开始为3 全部到对岸为0 int nSide // 船的位置 在此岸为-1 彼岸为1 int nMoveSavage // 渡河的野人的数量，用于递归时记录操作状态 int nMoveBoanerges // 渡河的传教士的数量，用于递归时记录操作状态 INFO* p
Businessmen
- 商人过河问题是数学建模中的一个经典问题，程序利用链表存储渡河状态，使用穷举的算法实现。该算法会找出N个商人/随从渡河的一个可行方案，但并不保证是最佳方案。-Businessmen river problem is Mathematical Modeling a classic problem, procedures use linked list storage crossing state, use exhaustive s algorithm. The algorithm will iden
Businessmen_Crossing_SRC
- 解决商人渡河问题。该问题为：有三个商人，三个强盗，和一条船（船每次只可以载小于等于两个人）他们同在河的一边，想渡过河去，但是必须保证在河的任何一边必须保证商人的数目大于等于强盗的数目，并要满足渡河次数尽可能的少，应该怎么过这条河呢？ -To solve business problems crossing. The problem is: There are three businessmen, three robbers, and a boat (each boat can only c
lingoeazyjiaocheng
- lingo入门教程，附有很多基础命令以及简单问题的分析，求解。例如病人吃饭，场地选址，渡河问题，人员相容问题，顺序安排工作问题，最短路线等等。-lingo Getting Started tutorial, with a lot of basic commands and a simple analysis of the problem, solution. For example, patients eat, site selection, cross the river issues, st
sr
- 商人过河问题是数学建模中的一个经典问题，程序利用链表存储渡河状态，使用穷举的算法实现。该算法会找出N个商人/随从渡河的一个可行方案，但并不保证是最佳方案。写完这个程序后让我想到的居然是图的深度优先搜索，二者在查找的思想上是类似的。3gpp的文件-Merchants across the river in the mathematical modeling problem is a classic problem, the program list storage to cross the riv
sr
- 商人过河问题是数学建模中的一个经典问题，程序利用链表存储渡河状态，使用穷举的算法实现。该算法会找出N个商人/随从渡河的一个可行方案，但并不保证是最佳方案。写完这个程序后让我想到的居然是图的深度优先搜索，二者在查找的思想上是类似的。-Mathematical modeling business across the river in question is a classic problem, the program memory to cross the river using the stat
HMPBoatte
- 启发式A*算法解决传教士士野人渡河问题 -Heuristic A* algorithm to solve the Savage crossing of the missionaries with disabilities
boat
- 实现人鬼同船,三人三鬼安全渡河，要求：两边岸都要保证人的数量不比鬼少 否则人会被鬼吃掉 另外 船上最多两人-people and ghost
chuanjiaoshi
- 三个传教士与三个野人渡河，只有传教士会划船，野人在岸上多于传教士会吃了传教士，一条船，只能带两个人，，用c语言实现野人与传教士问题-Three missionaries and three savage cross the river, only missionaries will be boating, Savage ashore than missionaries will eat the missionaries, a boat, only with two people, Savage
渡河问题
- 内附有传教士和野人渡河问题的MATLAB代码和详细注释(With the missionaries and wildlings crossing the river problem MATLAB code and detailed comments)