搜索资源列表
2004021803
- 1． 搜索算法应尽可能独立于具体问题。亦即搜索算法程序既可用于迷宫问题，也可用于九宫重排问题、修道士野人问题等-1. Search algorithm should be as independent as possible on specific issues. Search algorithm which can be used to the maze procedure, can also be used JiuGongTu rearrangement, monks Savage prob
2005042708574926641
- 前一阵子和朋友一起参与了一个实际的EJB(Enterprise JavaBean) 应用 系统开发，在其中学习到了许多有用的技术和经验。虽然目前的市面上已经有许 多讨论EJB 技术的书籍和文章，但是似乎尚未有以实际案例做为讨论内容。鉴 于目前许多公司和系统都开始采用Java 和EJB 的技术，因此笔者在此野人献 曝，希望以一个简化的范例来说明在开发EJB 应用系统时会遭遇到的技术问题 以及一些设计上的取舍。当然对于J2EE 有兴趣的读者也可以依据文章讨论的内 容跟随作者一起开发这个范例EJB 系
荒岛野人
- 这个是关于荒岛野人的算法实现，有什么问题请留言-the savage wasteland of the algorithm to achieve and what problems they please leave
nfgh.rar
- 用于实现农夫过河问题,使农夫 狼 羊 蔬菜可以安全过河,For the realization of farmers across the river, so that the wolf sheep farmer vegetables can safely cross the river
A_Star_M_C.rar
- 使用A*算法解决传教士与野人的问题，内含源代码直接编译即可运行。,The use of A* algorithm to solve the problem of the missionaries with the Savage, including the source code compiled to run directly.
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
8582
- 野人传教士:一个使用多选框的小智力题，传 教士与野人-Savage missionaries: a checkbox to use a small intellectual questions, missionaries and Savage
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
MissionaryPassRiver
- 原创，野人过河智力题面向对象解法！有三个传教士和三个野人一起过河，要求在河的任一边传教士的数目一定要大于野人的数目，否则野人就会吃掉传教士！可以到网上搜索flash游戏（野人过河）去玩！-Original, wild man of intelligence across the river title Object-Oriented Solution! There are three missionaries and three wild man to cross the river toget
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