Location:
Search - cannibals
Search list
Description: Missionaries and cannibals algorithm
Platform: |
Size: 4096 |
Author: rand123 |
Hits:
Description: 传教士与野人过河，刚开始有3个传教士和3个野人，如果野人的数量大于传教士的数量，则失败-Missionaries And Cannibals Puzzle Solver
Platform: |
Size: 11264 |
Author: LR |
Hits:
Description: 传教士与野从问题,源代码,使用产生式系统实现-missonaries and cannibals prolem,source code
Platform: |
Size: 2048 |
Author: skyfly180 |
Hits:
Description: This project solve cannibals and ministers problems with iterative deeping search.I am a computer engineer student. I write this project for one of my lessons (Artificial Intelligence).
Platform: |
Size: 15360 |
Author: somatco |
Hits:
Description: 野人过河问题，本实验研究了用人工智能的理论求解传教士(Missionaries)与野人(Cannibals)过河问题（M-C问题）。实验设计采用产生式系统的概念，将问题用状态空间表示，搜索技术采用状态空间启发式搜索的A算法，规则设计采用产生式规则，用C语言实现了A算法求解M-C问题，加深了对人工智能的认识与理解。-Savage river problems, this experimental study the theory of using artificial intelligence to solve the missionaries (Missionaries) and Savage (Cannibals) across the river question (MC issues). Experimental design uses the concept of production system, the problem is with the state space that the search technology uses state-space heuristic search algorithm A, the rules design uses production rules, using C language implementation of the MC algorithm to solve A problem has deepened the artificial intelligent knowledge and understanding.
Platform: |
Size: 3072 |
Author: 余光学 |
Hits:
Description: 野人过河问题，本实验研究了用人工智能的理论求解传教士(Missionaries)与野人(Cannibals)过河问题（M-C问题）。实验设计采用产生式系统的概念，将问题用状态空间表示，搜索技术采用状态空间启发式搜索的A算法，规则设计采用产生式规则，用C语言实现了A算法求解M-C问题，加深了对人工智能的认识与理解。-Savage river problems, this experimental study the theory of using artificial intelligence to solve the missionaries (Missionaries) and Savage (Cannibals) across the river question (MC issues). Experimental design uses the concept of production system, the problem is with the state space that the search technology uses state-space heuristic search algorithm A, the rules design uses production rules, using C language implementation of the MC algorithm to solve A problem has deepened the artificial intelligent knowledge and understanding.
Platform: |
Size: 148480 |
Author: 余光学 |
Hits:
Description: 人工智能解决野人传教士本实验研究了用人工智能的理论求解传教士(Missionaries)与野人(Cannibals)过河问题（M-C问题）。实验设计采用产生式系统的概念，将问题用状态空间表示，搜索技术采用状态空间启发式搜索的A*算法，规则设计采用产生式规则，用C语言实现了A*算法求解M-C问题，加深了对人工智能的认识与理解。过河问题。-Of artificial intelligence to solve Savage missionaries studied in this experiment with the theory of artificial intelligence to solve the missionaries (Missionaries) and Savage (Cannibals) across the river question (MC issues). Experimental design uses the concept of production system, the problem is with the state space that the search technology uses state-space heuristic search of the A* algorithm, rules design uses production rules, using C language implementation of the A* algorithm to solve the problem MC has deepened knowledge and understanding of artificial intelligence. Across the river problem.
Platform: |
Size: 3072 |
Author: 杨雨 |
Hits:
Description: 这是一个古典问题。假设有n个修道士和n个野人准备渡河，但只有一条能容纳c人的小船，为了防止野人侵犯修道士，要求无论在何处，修道士的个数不得少于野人的人数（除非修道士个数为0）。如果两种人都会划船，试设计一个算法，确定他们能否渡过河去，若能，则给出一个小船来回次数最少的最佳方案。
要求：
（1）用一个三元组（x1,x2,x3）表示渡河过程中各个状态。其中，x1表示起始岸上修道士个数，x2表示起始岸上野人个数，x3表示小船位置（0——在目的岸，1——在起始岸）。例如（2,1,1）表示起始岸上有两个修道士，一个野人，小船在起始岸一边。
采用邻接表做为存储结构，将各种状态之间的迁移图保存下来。
（2）采用广度搜索法，得到首先搜索到的边数最少的一条通路。
（3）输出数据
若问题有解（能渡过河去），则输出一个最佳方案。用三元组表示渡河过程中的状态，并用箭头指出这些状态之间的迁移：
目的状态←…中间状态←…初始状态。
若问题无解，则给出“渡河失败”的信息。
（4）求出所有的解。
-Monks and savage problem:Suppose there are n monks and n cannibals ready to cross the river,But there is only one boat which can accommodate c persons.In order to prevent the savage infringe upon the monks, it is required no matter where you are, the number of monks shall not be less than the number of wild man
Platform: |
Size: 214016 |
Author: panbowen |
Hits:
Description: Cannibals And Misionaries algorithm solving
Platform: |
Size: 8192 |
Author: Krissu |
Hits:
Description: This cannibals and missionaries program is the first AI problem that used modern techniques of search trees. This design document describes the implementation made by Chris Lattner-This cannibals and missionaries program is the first AI problem that used modern techniques of search trees. This design document describes the implementation made by Chris Lattner
Platform: |
Size: 242688 |
Author: mehdi dehghani |
Hits:
Description: This cannibals and missionaries program is the first AI problem that used modern techniques of search trees. This design document describes the implementation made by Chris Lattner-This cannibals and missionaries program is the first AI problem that used modern techniques of search trees. This design document describes the implementation made by Chris Lattner
Platform: |
Size: 2048 |
Author: mehdi dehghani |
Hits:
Description: 传教士和野人渡河问题，经典的人工智能，深度优先算法-Missionaries-and-Cannibals problem
Platform: |
Size: 183296 |
Author: shanran |
Hits:
Description: Farmer s Dilemma Problem
Another classic AI problem (cannibals and the
missionary) in agricultural terms. The point is
to get the farmer, the fox the cabbage and the
goat across a stream.
But the boat only holds 2 items. If left
alone with the goat, the fox will eat it. If
left alone with the cabbage, the goat will eat
it.
This example uses COOL classes and
message-handlers to solve the problem.-Farmer s Dilemma Problem
Another classic AI problem (cannibals and the
missionary) in agricultural terms. The point is
to get the farmer, the fox the cabbage and the
goat across a stream.
But the boat only holds 2 items. If left
alone with the goat, the fox will eat it. If
left alone with the cabbage, the goat will eat
it.
This example uses COOL classes and
message-handlers to solve the problem.
Platform: |
Size: 1024 |
Author: 林 |
Hits:
Description: Missionarie And Cannibals Problem
Platform: |
Size: 25600 |
Author: Faysal |
Hits:
Description: Cannibals And Misionaries algorithm solving
Platform: |
Size: 8192 |
Author: vingmil |
Hits:
Description: Missionary and cannibals problem , artificial intelligent-Missionary and cannibals problem , artificial intelligent
Platform: |
Size: 14336 |
Author: mohammad |
Hits:
Description: Rules to solve the problem about Missionaries and Cannibals
Platform: |
Size: 293888 |
Author: Fazil |
Hits:
Description: The missionaries and cannibals problem, and the closely related jealous husbands problem, are classic river-crossing problems. The missionaries and cannibals problem is a well-known toy problem in artificial intelligence, where it was used by Saul Amarel as an example of problem representation
Platform: |
Size: 13312 |
Author: mmaawadi
|
Hits:
Description: 三个和尚三个鬼过河。小船最多两个乘坐，最少一个。任何时候，在两岸边如果鬼的数量多于和尚，那么和尚就吃掉鬼，任务失败。(Please help the 3 cannibals and 3 missionaries to move to the other side of the lake.notice that:when there is on one side more cannibals than missionaries,the eat them)
Platform: |
Size: 185344 |
Author: 谈不上 |
Hits: