搜索资源列表
mnc
- Missionaries and cannibals algorithm
MACPS
- 传教士与野人过河，刚开始有3个传教士和3个野人，如果野人的数量大于传教士的数量，则失败-Missionaries And Cannibals Puzzle Solver
missonaries_and_cannibals
- 传教士与野从问题,源代码,使用产生式系统实现-missonaries and cannibals prolem,source code
MinistersAndCannibals_IDS
- 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).
SY0915129
- 野人过河问题，本实验研究了用人工智能的理论求解传教士(Missionaries)与野人(Cannibals)过河问题（M-C问题）。实验设计采用产生式系统的概念，将问题用状态空间表示，搜索技术采用状态空间启发式搜索的A算法，规则设计采用产生式规则，用C语言实现了A算法求解M-C问题，加深了对人工智能的认识与理解。-Savage river problems, this experimental study the theory of u
rengongzhineng
- 野人过河问题，本实验研究了用人工智能的理论求解传教士(Missionaries)与野人(Cannibals)过河问题（M-C问题）。实验设计采用产生式系统的概念，将问题用状态空间表示，搜索技术采用状态空间启发式搜索的A算法，规则设计采用产生式规则，用C语言实现了A算法求解M-C问题，加深了对人工智能的认识与理解。-Savage river problems, this experimental study the theory of u
MCproblem
- 人工智能解决野人传教士本实验研究了用人工智能的理论求解传教士(Missionaries)与野人(Cannibals)过河问题（M-C问题）。实验设计采用产生式系统的概念，将问题用状态空间表示，搜索技术采用状态空间启发式搜索的A*算法，规则设计采用产生式规则，用C语言实现了A*算法求解M-C问题，加深了对人工智能的认识与理解。过河问题。-Of artificial intelligence to solve Savage missiona
Monks-and-savage-problem
- 这是一个古典问题。假设有n个修道士和n个野人准备渡河，但只有一条能容纳c人的小船，为了防止野人侵犯修道士，要求无论在何处，修道士的个数不得少于野人的人数（除非修道士个数为0）。如果两种人都会划船，试设计一个算法，确定他们能否渡过河去，若能，则给出一个小船来回次数最少的最佳方案。 要求： （1）用一个三元组（x1,x2,x3）表示渡河过程中各个状态。其中，x1表示起始岸上修道士个数，x2表示起始岸上野人个数，x3表示小船位置（0—
MisionariesAndCannibals
- Cannibals And Misionaries algorithm solving
cannibals-missionarie-Delphi
- 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
cannibals-missionarieJAVA
- 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
Missionaries-and-Cannibals-problem
- 传教士和野人渡河问题，经典的人工智能，深度优先算法-Missionaries-and-Cannibals problem
dilemma2
- 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 onl
MissionariesAndCannibals
- Missionarie And Cannibals Problem
MisionariesAndCannibals
- Cannibals And Misionaries algorithm solving
MissCanApp
- Missionary and cannibals problem , artificial intelligent-Missionary and cannibals problem , artificial intelligent
MissionariesCannibals
- Rules to solve the problem about Missionaries and Cannibals
MissCanApp (1)
- 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
logic2abc
- 三个和尚三个鬼过河。小船最多两个乘坐，最少一个。任何时候，在两岸边如果鬼的数量多于和尚，那么和尚就吃掉鬼，任务失败。(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 e