搜索资源列表
problem1
- 传教士野人渡河问题C++代码实现,更改N和K即可实现不同数目问题的求解
savage
- 传教士和野人渡河问题盲目搜索算法 一个典型的人工智能算法-missionaries and Savage cross river blind search algorithm of a typical artificial intelligence algorithms
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
mc-problem
- N个传教士和野人的渡河问题，采用递归算法-Missionaries and the savages of N crossing problem, using a recursive algorithm
ferry
- 野人与传教士（渡河）问题，输入参数n和k，从文件中读入，答案输出到文件。-Savage and missionaries (crossing) problem, the input parameters n and k, read from the file, the answer is output to a file.
Missionaries-and-Cannibals-problem
- 传教士和野人渡河问题，经典的人工智能，深度优先算法-Missionaries-and-Cannibals problem