搜索资源列表
src
- 商人过河问题是数学建模中的一个经典问题，程序利用链表存储渡河状态，使用穷举的算法实现。该算法会找出N个商人/随从渡河的一个可行方案，但并不保证是最佳方案。写完这个程序后让我想到的居然是图的深度优先搜索，二者在查找的思想上是类似的。-Merchants across the river mathematical modeling problem is a classic problem, the use of list storage procedures to cross the river,
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.
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
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
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
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
cross-the-river
- 在河的一岸，人、狼、羊、菜、均要过河，船需人划，而且最多载一物，当人不在时，狼会吃羊，羊会吃菜；试安排人狼羊菜安全渡河。-In a shore of the river, people, wolves, sheep, vegetables, to cross the river, boats need someone to plan, and set out up to one thing, when the person is not, the wolf will eat the sheep,
ai
- 有三个传教士和三个野人过河，只有一条能装下两个人的船，在河的任何一方或者船上，如果野人的人数大于牧师的人数，那么牧师就会被吃掉。设计方法让所有人安全渡河。-There are three missionaries and three Savage river, only one person can hold two boats, boat or on either side of the river, if the number is greater than the number of sa
dog_chicken
- 实现的主要功能是解决狗、鸡、白菜渡河问题。(The main function is to solve the problem of dog, chicken and cabbage crossing the river.)
渡河问题
- 内附有传教士和野人渡河问题的MATLAB代码和详细注释(With the missionaries and wildlings crossing the river problem MATLAB code and detailed comments)