搜索资源列表
code
- 利用C解决传教士与野人问题。有N个传教士和N个野人来到河边准备渡河,河岸有一条船,每次之多可供k个人乘渡。传教士为了安全起见,任何时刻,河两岸以及船上的野人数目总是不能超过传教士的数目(传教士数目为0除外)。求解一个可以令传教士和野人安全从左岸全部摆渡到右岸的过程。-Missionaries and savages in C to solve the problem. There are N and N Savage missionaries came to the river ready to
yrgh.rar
- 用Prolog求解传教士和野人问题 复习经典谓词演算中的归结原理,掌握人工智能程序设计语言Prolog,理解通过搜索求解问题实现人工智能的思想。,Using Prolog to solve the issue of missionaries and Savage Classical Predicate Calculus review summarized in principle, grasp the artificial intelligence programming language P
SY0915129
- 野人过河问题,本实验研究了用人工智能的理论求解传教士(Missionaries)与野人(Cannibals)过河问题(M-C问题)。实验设计采用产生式系统的概念,将问题用状态空间表示,搜索技术采用状态空间启发式搜索的A算法,规则设计采用产生式规则,用C语言实现了A算法求解M-C问题,加深了对人工智能的认识与理解。-Savage river problems, this experimental study the theory of using artificial intelligence t
chuanjiaoshi
- 1. 野人与传教士过河问题:有传教士和野人各三人需要过河,他们都会划船。现只有一条船,一次只能载两人。假设野人多于传教士时传教士就会被吃掉。编程求出所有能确保全部安全的过河的计划,并给出Visual Prolog程序-1. Savage and missionaries across the river problem: There are three missionaries and savages the need to cross the river, they will be boati
MC-Solve
- 野人与传教士问题的求解程序,对N=3,K=2给出正确路径-Savage with the missionary problem solving procedures, N = 3, K = 2 are given the correct path
yeren
- 野人过河问题,可能有点问题,但基本思想是对的,大家再查一下-Savage across the river issues, may be a bit problem, but the basic idea is correct, we re-check
Boanergesandsavage
- 同学做的野人与传教士过河问题的程序 三个野人三个传教士 每次最多过两个人-Savage classmates to do with the issue of missionaries across the river three procedures Savage had a maximum of three missionaries, two people
VCchuangjiaoshiyeren
- 传教士与野人问题,经典问题代码,课程设计所做-Missionaries with savage problems, the classic problem of code, curriculum design done
cankao
- 野人传教士问题,利用产生式系统解决,主要是说明。-Savage missionary problems, the use of production system to solve, mainly states.
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.
yerenyuxiudaoshiwenti
- 自己编写的人工智能中野人与修道士问题的程序。-I have written with the monks of artificial intelligence in the issue of Savage procedures.
NNK
- 野人传教士NNK 产生式系统简单实例 非常经典的算法 -Savage missionaries NNK production system is a classic example of a simple algorithm
N_missionaries_and_N_Savage
- 历史上著名的N教士与N野人问题,有点意思!-N missionaries with the issue of N Savage
winep_code
- 这是一个典型的产生式系统的算法题.用的是有界深度优先的递归算法,是用C++Builder4.0写的.这也是人工智能或者程序设计竞赛题中最基本最常用的算法.如果自己动手编程实现了一个这样的题目,那么很多相关的题目也就都一样可以做了,比如"四皇后问题","推箱子问题","传教士和野人问题"等等。 利用深度优先的算法都是不一定能找到最优路径的,而且如果解路径过长的话还可能会搜索失败.如果保证要找到最优路径需要用另一些算法,比如宽度优先算法.无论是哪一种算法,如果问题稍微复杂一点的话,都要解决"
SavageAcrossTheRiver
- 假设有N个修道士和N个野人准备渡河,但只有一天能容纳C人的小船,为了防止野人吃掉修道士,要求无论在何处(即两岸、船上),修道士的人数不得少于野人的人数(除非修道士人数为0)。如果两种人都会划船,试设计一个程序,确定他们能否渡过河去,若能,则给出一个小船来回次数最少的最佳方案,并打印出船来回的状态及野人和修道士人数变化状态。-Savage Across The River
artificial_intelligence_demo_programs
- 光盘中的演示实例是人工智能原理和方法的演示程序.包括基于归结原理的推理系统,合一算法,等式归结,归类算法,野人与传教士过河问题,八数码问题,八皇后问题,一字棋,博弈算法,遗传算法和蚁群算法等的演示。-CD-ROM presentation of a number of examples of the hard work of graduate and undergraduate results. Including reasoning based on the principle of the
artificial_intelligence_demo_programs
- 光盘中的演示实例是人工智能原理和方法的演示程序.包括基于归结原理的推理系统,合一算法,等式归结,归类算法,野人与传教士过河问题,八数码问题,八皇后问题,一字棋,博弈算法,遗传算法和蚁群算法等的演示。-CD-ROM presentation of examples of the principles and methods of artificial intelligence demo program. Including reasoning based on the principle of t
23
- 传教士与野人过河问题是经典的人工智能问题,本程序采用深度优先算法解决此问题。-Savage missionaries across the river and the artificial intelligence problem is a classic problem, the procedures for the use of depth-first algorithm to solve this problem.
xds
- 数据结构的经典问题,修道士与野人过河 求解步骤 源码-Classic problem of data structure, monks and Savage solving steps across the river source
Savage_with_plans_to_cross_the_river_breadth_first
- 关于野人过河问题中的程序设计,包括用图的广度优先搜索算法-Across the river on the Savage program design issues, including breadth-first graph search algorithm