搜索资源列表
VC野人八数码程序
- 用VC编制的集成的野人和八数码演示程序。其中野人程序用动态的效果演示，并能设置进度。八数码程序能根据给出的源状态转换成目标状态。-VC establishment of integrated Savage and eight digital presentations. Savage procedures which use dynamic demonstration effect, and can be programmed to progress. Eight digital process
TSP和野人过河
- 货郎担问题和野人过河问题，解压后有word文档，里面有详细说明-traveling salesman problem and savage river, unpacked a word document, containing details
xyzzyzzz
- 产生式系统中传教士和野人问题的java版 产生式系统中传教士和野人问题的java版-production system missionaries and Savage java version of the Production S ystem missionaries and savage version of the java
传教士与野人渡河问题深度优先搜索
- 学习人工智能作的一个小设计，用VC++6.0来基本实现传教士和野人渡河问题，这个算法是应用深度优先搜索算法。-study artificial intelligence for a small design, VC 6.0 to achieve missionaries and savage river, the algorithm is the use of depth-first search algorithm.
野人传教士问题
- 这是关于人工智能中关于传教士和野人问题的详细说明，请大家参考，提出修改意见-on Artificial Intelligence missionaries and Savage on the details, please refer to proposed amendments. .
修道士与野人1.9
- 用C++实现传教士与野人问题，其中规定有一个野人不会划船的人工智能问题-C and Savage realize missionaries, which is not a savage row of artificial intelligence problem
野人过河
- 有JAVA写的一个小程序 是关于人工智能的野人过河的 看看有需要的没？ -have written a small program on artificial intelligence Savage cross the river to see if there is no need?
野人-传教士
- 用c++实现的人工智能中野人和传教士问题，有注释部分！-achieve with the AI Savage and missionaries, a Notes!
savage
- 传教士和野人渡河问题盲目搜索算法 一个典型的人工智能算法-missionaries and Savage cross river blind search algorithm of a typical artificial intelligence algorithms
a-unified-mathematical-framework
- a unified mathematical framework, one of paul Savage s important articles
Monks-and-savage-problem
- 这是一个古典问题。假设有n个修道士和n个野人准备渡河，但只有一条能容纳c人的小船，为了防止野人侵犯修道士，要求无论在何处，修道士的个数不得少于野人的人数（除非修道士个数为0）。如果两种人都会划船，试设计一个算法，确定他们能否渡过河去，若能，则给出一个小船来回次数最少的最佳方案。 要求： （1）用一个三元组（x1,x2,x3）表示渡河过程中各个状态。其中，x1表示起始岸上修道士个数，x2表示起始岸上野人个数，x3表示小船位置（0——在目的岸，1——在起始岸）。例如（2,1,1）表示起始岸上
Savage-and-preachers
- 从前有一条河，河的左岸有m个传教士、m个野人和一艘最多可乘n人的小船。约定左岸，右岸和船上或者没有传教士，或者野人数量少于传教士，否则野人会把传教士吃掉。搜索一条可使所有的野人和传教士安全渡到右岸的方案。-Once upon a time there was a river, on the left bank of the river have m a missionary, m a savage and a ship can take up a man s boat. On the agree
Missionaries-With-Savage-Problems-
- 在人工智能中用A*算法解决传教士与野人问题，最后输出解决方案-Using the A* algorithm to solve the Missionaries With Savage Problems
Savage-crossing-the-river-problem-
- 野人过河问题c语言实现，功能实现较为完整，很值得一看-Savage crossing the river problem c language function to achieve a more complete, and well worth a visit
Paul_G.Savage
- GNSS接收机惯性导航处理算法技术文档,用于提高导航接收机性能，在高动态环境下具有良好的稳健性-technique paper for GNSS receiver inertial navigation algorithm
Savage-across-the-river
- 实现野人过河问题，找出过河的方法。我自己写的，有注释，且可以正确运行。-To achieve the the Savage river issues, ways to cross the river. I wrote it myself, annotations, and can be run properly.
Paul-G.-Savage
- Paul G.Savage 发表的论文整理-The published papers by Paul G.Savage
savage
- 传教士与野人渡河问题，人工智能空间状态表示法题目-Missionaries and Savage crossing problems, artificial intelligence
missionary-and-savage
- 传教士与野人问题的c++解法，可运行。是完整的程序包-Missionaries and c++ solution Savage problems, you can run. It is the complete package
the-problem-of-evangelist-and-savage
- 有3个传教士和3个野人要过河，现在有一条船只能承载2个人（包括野人），在任何时刻，如果有野人和传教士在一起，必须要求传教士的人数多于或等于野人的人数。 -There are three missionaries and three savages to cross the river, and now a vessel can carry two people (including savages), at any moment, if there are savages and mission