搜索资源列表
传教士与野人渡河问题深度优先搜索
- 学习人工智能作的一个小设计，用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.
fdhdxfhdxfhdjBeep
- 断通也对如有二月二有二野人呀二月而言而已热饮-broken links are two right there in February when two savage ah February only hot drinks
MCBoat
- 传教士和野人问题，最简单的宽度优先搜索方法实现-missionaries and savage, the most simple width priority search method
Microsoft-Programmin-Microsoft-DirectShow-for-Digi
- A book is rarely written alone although a title might have one author, there are a host of midwives who help it into being. First and foremost, thanks go to the Microsoft DirectShow team, who created this technology, and especially to the following m
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 系
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.
MC
- 野人与传教士问题 野人与修道士问题 m个野人n个传教士船载重为k-missionary and cannibal Churchman and savage
MonksandSavageproblem
- 修道士与野人问题 struct INFO { int nSavage // 岸边野人的数量 开始为3 全部到对岸为0 int nBoanerges // 岸边传教士的数量 开始为3 全部到对岸为0 int nSide // 船的位置 在此岸为-1 彼岸为1 int nMoveSavage // 渡河的野人的数量，用于递归时记录操作状态 int nMoveBoanerges // 渡河的传教士的数量，用于递归时记录操作状态 INFO* p
churchman
- 使用A*算法的传教士与野人的VC程序。。期望大家指正-himself wrote a missionary with the Savage issue procedures. Program structure more clearly. Complete installation of artificial intelligence inside the structure.
895
- n个野人n个传教士过河问题的代码，文件输出结果-n n-Savage problem missionary cross the river code, files output
test
- 此程序是关于求解野人和传教士的过河问题。实现自动对一个智利测试题的求解！-This program is about the savage and missionaries across the river to solve the problem. Automatic testing of a Chilean problem solving!
a-unified-mathematical-framework
- a unified mathematical framework, one of paul Savage s important articles
humanintll
- 传教士野人过河源码 c c++ 搜索问题 广度优先-Savage missionaries across the river source c c++ search problem breadth-first
HMPBoatte
- 启发式A*算法解决传教士士野人渡河问题 -Heuristic A* algorithm to solve the Savage crossing of the missionaries with disabilities
chuanjiaoshi
- 三个传教士与三个野人渡河，只有传教士会划船，野人在岸上多于传教士会吃了传教士，一条船，只能带两个人，，用c语言实现野人与传教士问题-Three missionaries and three savage cross the river, only missionaries will be boating, Savage ashore than missionaries will eat the missionaries, a boat, only with two people, Savage
ye-ren-guo-he
- 野人过河问题你懂的哦 详细代码Savage river issues detailed code-Savage river issues detailed code
guohe
- 传教士野人过河问题的3人版，人工智能作业 应该有用-Savage missionaries across the river
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